Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Turing completeness
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==Further reading== {{Refbegin}} * {{cite book |last1=Brainerd |first1=W. S. |author2-link=Lawrence Landweber |last2=Landweber |first2=L. H. |date=1974 |title=Theory of Computation |publisher=Wiley |isbn=0-471-09585-0 |url-access=registration |url=https://archive.org/details/theoryofcomputat00brai}} * {{cite magazine |url=https://newscientist.com/article/dn12826-simplest-universal-computer-wins-student-25000.html |title=Simplest 'universal computer' wins student $25,000 |first=Jim |last=Giles |magazine=[[New Scientist]] |date=24 October 2007 }} * {{cite book |editor-last=Herken |editor-first=Rolf |date=1995 |title=The Universal Turing Machine: A Half-Century Survey |publisher=Springer Verlag |isbn=3-211-82637-8}} * {{Cite journal | last= Turing | first= A. M. |date=1936 | title = On Computable Numbers, with an Application to the Entscheidungsproblem | periodical = Proceedings of the London Mathematical Society | series = 2 | volume = 42 | pages = 230β265 | doi= 10.1112/plms/s2-42.1.230 | s2cid= 73712 | url = https://www.abelard.org/turpap2/tp2-ie.asp <!-- | url = https://cs.ox.ac.uk/activities/ieg/e-library/sources/tp2-ie.pdf --> }} * {{Cite journal| last = Turing | first = A. M. |date=1938 | title = On Computable Numbers, with an Application to the Entscheidungsproblem: A correction | periodical = Proceedings of the London Mathematical Society | series = 2 | volume = 43 | pages = 544β546 | doi = 10.1112/plms/s2-43.6.544}} {{Refend}}
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)