%0 Journal Article %1 turing1936a %A Turing, Alan M. %D 1936 %J Proceedings of the London Mathematical Society %K halting %N 42 %P 230--265 %T On Computable Numbers, with an Application to the Entscheidungsproblem %U http://www.cs.helsinki.fi/u/gionis/cc05/OnComputableNumbers.pdf %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 = {2014-03-17T15:41:01.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/2b51d7b5c67fb98e0117bc176ee5fd5cf/fibso}, interhash = {8ac1f5e961ff74849ab6f0c7348b9c9c}, intrahash = {b51d7b5c67fb98e0117bc176ee5fd5cf}, journal = {Proceedings of the London Mathematical Society}, keywords = {halting}, number = 42, pages = {230--265}, timestamp = {2014-03-17T15:41:01.000+0100}, title = {On Computable Numbers, with an Application to the {E}ntscheidungsproblem}, url = {http://www.cs.helsinki.fi/u/gionis/cc05/OnComputableNumbers.pdf}, volume = 2, year = 1936 }