This document discusses the history of computability theory and explores concepts like recursive functions, abacus, and busy beaver functions. It mentions Alan Turing, Alonzo Church, and their contributions to establishing computability and defining what is computable with formal systems like the lambda calculus. The document also references intuitionistic logic and discusses representing bits and bytes for computations over the internet.

2. 1937),
.
(
)

3. -
- .
refuted
- counterexample
-
notions
recursive abacus,

4. 1
1.1
2
2.1
2.2
3
4
5
5.1 Busy Beaver
5.2
6
6.1
6.2 Abacus
7
Internet

5. '0' '1'
1) (2
3)

6. Talk of
intution
Q
Σ