# computer\_science

## Basic idea

The study of computation: what can be computed, how efficiently, and with which abstractions. Spans theory (complexity, computability), systems (OS, distributed), languages, data structures, and AI.

## Key formulas

* Big-O: $f(n) = O(g(n)) \iff \exists c, n\_0.\ \forall n \ge n\_0.\ f(n) \le c, g(n)$
* Master theorem: $T(n) = a T(n/b) + f(n)$
* Shannon entropy: $H(X) = -\sum\_i p\_i \log p\_i$
* Church-Turing thesis: computable = Turing-computable


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://isubasinghe.gitbook.io/isithas-wiki/computer_science.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.