Bibliography (12):

1. Unpredictable Iterations

2. Toward Mechanical Mathematics

3. How the Slowest Computer Programs Illuminate Math’s Fundamental Limits: The goal of the ‘busy beaver’ game is to find the longest-running computer program. Its pursuit has surprising connections to some of the most profound questions and concepts in mathematics

4. On Non-Computable Functions

5. Too good to be true: when overwhelming evidence fails to convince

6. The determination of the value of Rado’s noncomputable function Σ(𝑘) for four-state Turing machines

7. The complexity of small universal Turing machines: a survey

8. Wikipedia Bibliography:

   1. https://en.wikipedia.org/wiki/Set_theory

      https://en.wikipedia.org/wiki/Set_theory

   2. Collatz conjecture

   3. https://en.wikipedia.org/wiki/G%C3%B6del%27s_famous_Incompleteness_Theorem

      https://en.wikipedia.org/wiki/G%C3%B6del%27s_famous_Incompleteness_Theorem

   4. Halting problem

   5. FRACTRAN