A Relatively Small Turing Machine Whose Behavior Is Independent of Set Theory

Gödel, K. “The Consistency of the Axiom of Choice and of the Generalized Continuum-Hypothesis with the Axioms of Set Theory.” Published in 1940 by the Princeton University Press. Annals of Mathematics Studies

1940

Earlier work this paper cites.

Schoenfield, J. “The Problem of Predicativity.” Essays on the foundations of mathematics, Y. Bar-Hillel et al., eds., pp. 132-142. 1961

1961

Earlier work this paper cites.

Rado, T. “On Non-Computable Functions.” Bell System Technical Journal, 41: 3. May 1962 pp 877-884

1962

Earlier work this paper cites.

Lin, S., Rado, T. “Computer Studies of Turing Machine Problems.” Published in Journal of the ACM, Volume 12, Issue 2, April 1965. Pages 196-212

1965

Earlier work this paper cites.

Brady, A.H. “Solution of the Non-computable ‘Busy Beaver’ game for k = 4 k=4 .” Abstracts for: ACM Computer Science Conference (Washington, DC, February 18-20, 1975), p. 27, ACM, 1975

1975

Earlier work this paper cites.

Marxen, H., Buntrock, J. “Attacking the Busy Beaver 5.” Bull EATCS, Vol. 40, pp. 247-251. 1990

1990

Earlier work this paper cites.

Chaitin, G. “The Limits of Mathematics.” pp. 79. 1994

1994

Cited alongside, same era.

Koza, J. “Spontaneous Emergence of Self-Replicating and Evolutionarily Self-Improving Computer Programs.” in Artificial Life III (SFI Studies in the Sciences of Complexity, vol. XVII), C. G. Langton, Ed. Reading, MA: Addison-Wesley. pp. 225-262. 1994

1994

Cited alongside, same era.

Pargellis, A. “The Spontaneous Generation of Digital ‘Life.”’ Physica D, 91, 86-96. 1996

1996

Cited alongside, same era.

Ben-Amram, A., Petersen, H. “Improved Bounds for Functions Related to Busy Beavers” Theory of Computing Systems 35, 1-11 (2002)

2002

Cited alongside, same era.

Calude, C., Calude, E. “Evaluating the Complexity of Mathematical Problems: Part 1,” “Evaluating the Complexity of Mathematical Problems: Part 2.” Complex Systems 18, pp. 387-401. 2010

2010

Cloudy176, Wythagoras. “A good bound for S(7)?” 2014. http://googology.wikia.com/wiki/User_blog:Wythagoras/A_good_bound_for_S%287%29%3F

2014

Later among the works it cites.

Friedman, H. “Order Invariant Graphs and Finite Incompleteness.” https://u.osu.edu/friedman.8/files/2014/01/FIiniteSeqInc062214a-v9w7q4.pdf

2014

Later among the works it cites.

Friedman, H. “Order Theoretic Equations, Maximality, and Incompleteness.” June 7, 2014. http://u.osu.edu/friedman.8/foundational-adventures/downloadable-manuscripts

2014

Later among the works it cites.

Friedman H. “The Upper Shift Kernel Theorems.” October 9, 2010. https://u.osu.edu/friedman.8/files/2014/01/KernStruThm100910-1lu0b8v.pdf

2014

Later among the works it cites.

Aaronson, S. “The 8000th Busy Beaver number eludes ZF set theory: new paper by Adam Yedidia and me.” May 3, 2016. http://www.scottaaronson.com/blog/?p=2725#comments