◀ ▲ ▶Branches / Theoretical-computer-science / Computability / Part: Computability

Part: Computability

Computability is a term dealing with "what can be computed". In order to study compatibility, we have to make some formal definitions of problems and of computing.

Table of Contents

Examples: 1

1. Definition: Computational Problem, Solution
2. Definition: Algorithm (Effective Procedure)
3. Definition: $\mathcal P$-Computable and $\mathcal P$-Decidable Problems
4. Chapter: Models of Computation
5. Chapter: Correctness
6. Chapter: Decidability
7. Chapter: Entropy

Thank you to the contributors under CC BY-SA 4.0!

Github: