%0 Journal Article %1 turing1936a %A Turing, Alan M. %D 1936 %J Proc. London Math. Soc. %K automata-theory,automata-history %N 42 %P 230--265 %T On Computable Numbers, with an Application to the Entscheidungsproblem %V 2 %Z Turing's famous demonstration of the formal limits on computation based on a proof that the halting problem is undecidable.

@article{turing1936a, added-at = {2006-03-09T08:15:35.000+0100}, annote = {Turing's famous demonstration of the formal limits on computation based on a proof that the {\em halting problem} is undecidable.}, author = {Turing, Alan M.}, biburl = {https://www.bibsonomy.org/bibtex/2afd4c741be7c2c9176d2de3b080b8edf/snowball}, interhash = {8ac1f5e961ff74849ab6f0c7348b9c9c}, intrahash = {afd4c741be7c2c9176d2de3b080b8edf}, journal = {Proc. London Math. Soc.}, keywords = {automata-theory,automata-history}, number = 42, pages = {230--265}, timestamp = {2006-03-09T08:15:35.000+0100}, title = {On Computable Numbers, with an Application to the {E}ntscheidungsproblem}, volume = 2, year = 1936 }