An Unsolvable Problem of Elementary Number Theory, American Journal of Mathematics, vol.58, issue.2, pp.345-363, 1936. ,
DOI : 10.2307/2371045
Universality in elementary cellular automata, Complex Systems, vol.15, issue.1, pp.1-40, 2004. ,
Why G??del didn't have church's thesis, Dover publications, pp.3-24, 1965. ,
DOI : 10.1016/S0019-9958(82)91226-8
URL : http://doi.org/10.1016/s0019-9958(82)91226-8
His life and work, p.xi?xviii, 1994. ,
Closing the circle: An analysis of Emil Post's early work, The Bulletin of Symbolic Logic, vol.12, issue.2, pp.267-289, 2006. ,
The Confluence of Ideas in 1936, pp.55-111, 1988. ,
DOI : 10.1007/978-3-7091-6597-3_3
Remarks before the princeton bicentennial conference on problems in mathematics, pp.84-88, 1946. ,
Origins of recursive function theory, Annals of the history of computing, vol.3, pp.52-67, 1981. ,
Frontier between decidability and undecidability: a survey, Theoretical Computer Science, vol.231, issue.2, pp.217-251, 2000. ,
DOI : 10.1016/S0304-3975(99)00102-4
Small Turing machines and generalized busy beaver competition, Theoretical Computer Science, vol.326, issue.1-3, pp.45-56, 2004. ,
DOI : 10.1016/j.tcs.2004.05.008
URL : http://doi.org/10.1016/j.tcs.2004.05.008
Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing Machines, The Annals of Mathematics, vol.74, issue.3, pp.437-455, 1961. ,
DOI : 10.2307/1970290
Introduction to a general theory of elementary propositions, American Journal of Mathematics, vol.43, pp.163-185, 1921. ,
Mechanical procedures and mathematical experience, Mathematics and Mind (Oxford), pp.71-117, 1994. ,
Computability and recursion, The bulletin of Symbolic Logic, pp.284-321, 1996. ,
On computable numbers with an application to the Entscheidungsproblem A correction to the paper was published in the same journal, Proceedings of the London Mathematical Society, pp.230-265, 1936. ,