Turing completeness (English Wikipedia)

A 27th IOCCC Winner
Carlini, Nicolas; Barresi, Antonio; Payer, Mathias; Wagner, David; Gross, Thomas R. (August 2015). "Control-flow bending: on the effectiveness of control-flow integrity". Proceedings of the 24th USENIX Conference on Security Symposium. pp. 161–176. ISBN 978-1-931971-23-2.

adsabs.harvard.edu (Global: 14^th place; English: 9^th place)

ui.adsabs.harvard.edu

Rojas, Raul (1998). "How to make Zuse's Z3 a universal computer". Annals of the History of Computing. 20 (3): 51–54. Bibcode:1998IAHC...20c..51R. doi:10.1109/85.707574.
De Wynter, Adrian (2023). "Turing Completeness and Sid Meier's Civilization". IEEE Transactions on Games. 15 (2). IEEE: 292–9. Bibcode:2023ITGam..15..292D. doi:10.1109/TG.2022.3166874.
Chen, Yuan-Jyue; Dalchau, Neil; Srinivas, Niranjan; Phillips, Andrew; Cardelli, Luca; Soloveichik, David; Seelig, Georg (October 2013). "Programmable chemical controllers made from DNA". Nature Nanotechnology. 8 (10): 755–762. Bibcode:2013NatNa...8..755C. doi:10.1038/nnano.2013.189. PMC 4150546. PMID 24077029.
Soloveichik, David; Seelig, Georg; Winfree, Erik (23 March 2010). "DNA as a universal substrate for chemical kinetics". Proceedings of the National Academy of Sciences. 107 (12): 5393–8. Bibcode:2010PNAS..107.5393S. doi:10.1073/pnas.0909380107. PMC 2851759. PMID 20203007.

amazonaws.com (Global: 3,611^th place; English: 2,190^th place)

terra-docs.s3.us-east-2.amazonaws.com

J. Su, Caleb. "A new approach to Turing completeness in Baba is You" (PDF).

archive.org (Global: 6^th place; English: 6^th place)

Meyers, Scott (Scott Douglas) (2005). Effective C++: 55 specific ways to improve your programs and designs (3rd ed.). Upper Saddle River, NJ: Addison-Wesley. ISBN 0-321-33487-6. OCLC 60425273.

arstechnica.com (Global: 473^rd place; English: 338^th place)

Ouellette, Jennifer (23 June 2019). "It's possible to build a Turing machine within Magic: The Gathering". Ars Technica. Retrieved 12 March 2023.

arxiv.org (Global: 49^th place; English: 31^st place)

Michaelson, Greg (14 February 2020). "Programming Paradigms, Turing Completeness and Computational Thinking". The Art, Science, and Engineering of Programming. 4 (3) 4. arXiv:2002.06178. doi:10.22152/programming-journal.org/2020/4/4.
Schmidhuber, Jürgen (1997), "A computer scientist's view of life, the universe, and everything", in Freksa, Christian; Jantzen, Matthias; Valk, Rüdiger (eds.), Foundations of Computer Science: Potential — Theory — Cognition, Lecture Notes in Computer Science, vol. 1337, Springer, pp. 201–8, arXiv:quant-ph/9904050, doi:10.1007/bfb0052088, ISBN 978-3-540-69640-7, S2CID 17830241
Miranda, Eva; Ramos, Isaac (27 December 2025). "Classical billiards can compute". arXiv:2512.19156 [math.DS].

bham.ac.uk (Global: 6,455^th place; English: 3,713^th place)

web.mat.bham.ac.uk

Kaye, Richard (31 May 2007). "Infinite versions of minesweeper are Turing complete" (PDF). Archived from the original (PDF) on 3 August 2016. Retrieved 8 July 2016.

books.google.com (Global: 3^rd place; English: 3^rd place)

Stuart, Tom (2013). "7. Universality is Everywhere §Lambda Calculus". Understanding Computation: From Simple Machines to Impossible Programs. O'Reilly Media. p. 209. ISBN 978-1-4493-3011-8. In other words, RUN is a lambda calculus program that can simulate any Turing machine.
Calude, Cristian S. (2024). "§1.14 Programming languages with decidable Halting Problem". To Halt Or Not To Halt? That Is The Question. World Scientific. p. 30. ISBN 978-981-12-3229-9. Pseudocode programs have a powerful property: Turing completeness or universality. A programming language is called Turing complete or computationally universal if it can simulate any Turing machine.
Üçoluk, Göktürk; Kalkan, Sinan (2012). "§1.3.1 How to Choose a Programming Language for an Implementation". Introduction to Programming Concepts with Case Studies in Python. Springer. p. 13. ISBN 978-3-7091-1343-1. All paradigms, all programming languages and even all CPUs are equivalent. This is called the Turing Equivalence.
Goertzel, Ben (2013). "§1.1 Stochastic and Quantum Computation". The Structure of Intelligence: A New Mathematical Model of Mind. Springer. p. 13. ISBN 978-1-4612-4336-6. We have seen that a universal Turing machine can follow any precise set of instruction, at least in the sense that it can simulate any other computer.
Garnham, Alan (2017). "8. Conceptual issues §1. The computer as a model of the mind — Turing's thesis". Artificial Intelligence: An Introduction. Routledge. p. 164. ISBN 978-1-351-33786-1. The Universal Turing Machine can mimic the operation of any other Turing machine.
Mogensen, Torben Ægidius (2022). "Preface §Do We Need New Programming Languages?". Programming Language Design and Implementation. Springer Nature. p. 6. ISBN 978-3-031-11806-7.
Woodward, John R. (2003). "Modularity in Genetic Programming". In Ryan, Conor (ed.). Genetic Programming: 6th European Conference, EuroGP 2003, Essex, UK, April 14–16, 2003. Springer. p. 258. doi:10.1007/3-540-36599-0_23. ISBN 978-3-540-00971-9.
Rauber, Thomas; Rünger, Gudula (2013). Parallel programming: for multicore and cluster systems (2nd ed.). Springer. ISBN 978-3-642-37801-0.

doi.org (Global: 2^nd place; English: 2^nd place)

Michaelson, Greg (14 February 2020). "Programming Paradigms, Turing Completeness and Computational Thinking". The Art, Science, and Engineering of Programming. 4 (3) 4. arXiv:2002.06178. doi:10.22152/programming-journal.org/2020/4/4.
Woodward, John R. (2003). "Modularity in Genetic Programming". In Ryan, Conor (ed.). Genetic Programming: 6th European Conference, EuroGP 2003, Essex, UK, April 14–16, 2003. Springer. p. 258. doi:10.1007/3-540-36599-0_23. ISBN 978-3-540-00971-9.
Rojas, Raul (1998). "How to make Zuse's Z3 a universal computer". Annals of the History of Computing. 20 (3): 51–54. Bibcode:1998IAHC...20c..51R. doi:10.1109/85.707574.
Rojas, Raúl (1 February 2014). "Konrad Zuse und der bedingte Sprung" [Konrad Zuse and the conditional jump]. Informatik-Spektrum (in German). 37 (1): 50–53. doi:10.1007/s00287-013-0717-9. ISSN 0170-6012. S2CID 1086397.
Schmidhuber, Jürgen (1997), "A computer scientist's view of life, the universe, and everything", in Freksa, Christian; Jantzen, Matthias; Valk, Rüdiger (eds.), Foundations of Computer Science: Potential — Theory — Cognition, Lecture Notes in Computer Science, vol. 1337, Springer, pp. 201–8, arXiv:quant-ph/9904050, doi:10.1007/bfb0052088, ISBN 978-3-540-69640-7, S2CID 17830241
De Wynter, Adrian (2023). "Turing Completeness and Sid Meier's Civilization". IEEE Transactions on Games. 15 (2). IEEE: 292–9. Bibcode:2023ITGam..15..292D. doi:10.1109/TG.2022.3166874.
Shah, Shalin; Wee, Jasmine; Song, Tianqi; Ceze, Luis; Strauss, Karin; Chen, Yuan-Jyue; Reif, John (4 May 2020). "Using Strand Displacing Polymerase To Program Chemical Reaction Networks". Journal of the American Chemical Society. 142 (21): 9587–93. doi:10.1021/jacs.0c02240. ISSN 0002-7863. PMID 32364723. S2CID 218504535.
Chen, Yuan-Jyue; Dalchau, Neil; Srinivas, Niranjan; Phillips, Andrew; Cardelli, Luca; Soloveichik, David; Seelig, Georg (October 2013). "Programmable chemical controllers made from DNA". Nature Nanotechnology. 8 (10): 755–762. Bibcode:2013NatNa...8..755C. doi:10.1038/nnano.2013.189. PMC 4150546. PMID 24077029.
Srinivas, Niranjan; Parkin, James; Seelig, Georg; Winfree, Erik; Soloveichik, David (15 December 2017). "Enzyme-free nucleic acid dynamical systems". Science. 358 (6369) eaal2052. doi:10.1126/science.aal2052. ISSN 0036-8075. PMID 29242317.
Soloveichik, David; Seelig, Georg; Winfree, Erik (23 March 2010). "DNA as a universal substrate for chemical kinetics". Proceedings of the National Academy of Sciences. 107 (12): 5393–8. Bibcode:2010PNAS..107.5393S. doi:10.1073/pnas.0909380107. PMC 2851759. PMID 20203007.
Shapiro, Ehud (7 December 1999). "A Mechanical Turing Machine: Blueprint for a Biomolecular Computer". Interface Focus. 2 (4). Weizmann Institute of Science: 497–503. doi:10.1098/rsfs.2011.0118. PMC 3363030. PMID 22649583.

emis.de (Global: low place; English: low place)

cs.emis.de

Churchill, Alex; Biderman, Stella; Herrick, Austin (2020). Magic: The Gathering Is Turing Complete (PDF). 10th International Conference on Fun with Algorithms. Archived from the original (PDF) on 23 September 2025.

hackaday.com (Global: low place; English: 7,931^st place)

Williams, Al (21 March 2021). "One Instruction To Rule Them All: C Compiler Emits Only MOV". Hackaday. Retrieved 23 October 2023.

ioccc.org (Global: low place; English: low place)

A 27th IOCCC Winner
Carlini, Nicolas; Barresi, Antonio; Payer, Mathias; Wagner, David; Gross, Thomas R. (August 2015). "Control-flow bending: on the effectiveness of control-flow integrity". Proceedings of the 24th USENIX Conference on Security Symposium. pp. 161–176. ISBN 978-1-931971-23-2.

itnext.io (Global: low place; English: low place)

Dabler, Ryan (23 September 2021). "TypeScript and Turing Completeness". ITNEXT. LINKIT. Retrieved 12 November 2022.

kotaku.com (Global: 460^th place; English: 318^th place)

Plunkett, Luke (16 July 2019). "Cities: Skylines Map Becomes A Poop-Powered Computer". Kotaku. Retrieved 16 July 2019.

litherum.blogspot.com (Global: low place; English: low place)

Litherum (7 March 2019). "Litherum: Addition Font". Litherum. Retrieved 23 May 2026.

microsoft.com (Global: 263^rd place; English: 259^th place)

techcommunity.microsoft.com

"Announcing LAMBDA: Turn Excel formulas into custom functions". TECHCOMMUNITY.MICROSOFT.COM. 3 December 2020. Retrieved 8 December 2020.

nih.gov (Global: 5^th place; English: 5^th place)

pubmed.ncbi.nlm.nih.gov

Shah, Shalin; Wee, Jasmine; Song, Tianqi; Ceze, Luis; Strauss, Karin; Chen, Yuan-Jyue; Reif, John (4 May 2020). "Using Strand Displacing Polymerase To Program Chemical Reaction Networks". Journal of the American Chemical Society. 142 (21): 9587–93. doi:10.1021/jacs.0c02240. ISSN 0002-7863. PMID 32364723. S2CID 218504535.
Chen, Yuan-Jyue; Dalchau, Neil; Srinivas, Niranjan; Phillips, Andrew; Cardelli, Luca; Soloveichik, David; Seelig, Georg (October 2013). "Programmable chemical controllers made from DNA". Nature Nanotechnology. 8 (10): 755–762. Bibcode:2013NatNa...8..755C. doi:10.1038/nnano.2013.189. PMC 4150546. PMID 24077029.
Srinivas, Niranjan; Parkin, James; Seelig, Georg; Winfree, Erik; Soloveichik, David (15 December 2017). "Enzyme-free nucleic acid dynamical systems". Science. 358 (6369) eaal2052. doi:10.1126/science.aal2052. ISSN 0036-8075. PMID 29242317.
Soloveichik, David; Seelig, Georg; Winfree, Erik (23 March 2010). "DNA as a universal substrate for chemical kinetics". Proceedings of the National Academy of Sciences. 107 (12): 5393–8. Bibcode:2010PNAS..107.5393S. doi:10.1073/pnas.0909380107. PMC 2851759. PMID 20203007.
Shapiro, Ehud (7 December 1999). "A Mechanical Turing Machine: Blueprint for a Biomolecular Computer". Interface Focus. 2 (4). Weizmann Institute of Science: 497–503. doi:10.1098/rsfs.2011.0118. PMC 3363030. PMID 22649583.

ncbi.nlm.nih.gov

Chen, Yuan-Jyue; Dalchau, Neil; Srinivas, Niranjan; Phillips, Andrew; Cardelli, Luca; Soloveichik, David; Seelig, Georg (October 2013). "Programmable chemical controllers made from DNA". Nature Nanotechnology. 8 (10): 755–762. Bibcode:2013NatNa...8..755C. doi:10.1038/nnano.2013.189. PMC 4150546. PMID 24077029.
Soloveichik, David; Seelig, Georg; Winfree, Erik (23 March 2010). "DNA as a universal substrate for chemical kinetics". Proceedings of the National Academy of Sciences. 107 (12): 5393–8. Bibcode:2010PNAS..107.5393S. doi:10.1073/pnas.0909380107. PMC 2851759. PMID 20203007.
Shapiro, Ehud (7 December 1999). "A Mechanical Turing Machine: Blueprint for a Biomolecular Computer". Interface Focus. 2 (4). Weizmann Institute of Science: 497–503. doi:10.1098/rsfs.2011.0118. PMC 3363030. PMID 22649583.

odu.edu (Global: low place; English: 7,704^th place)

cs.odu.edu

"Turing Completeness". www.cs.odu.edu. Retrieved 11 May 2026.

postgresql.org (Global: low place; English: low place)

wiki.postgresql.org

Dfetter; Breinbaas (8 August 2011). "Cyclic Tag System". PostgreSQL wiki. Retrieved 10 September 2014.

researchgate.net (Global: 96^th place; English: 89^th place)

Rojas, Raul (1998). "How to make Zuse's Z3 a universal computer". Annals of the History of Computing. 20 (3): 51–54. Bibcode:1998IAHC...20c..51R. doi:10.1109/85.707574.

rockpapershotgun.com (Global: 1,189^th place; English: 738^th place)

Caldwell, Brendan (20 November 2017). "Opus Magnum player makes an alchemical computer". Rock Paper Shotgun. Retrieved 23 September 2019.

semanticscholar.org (Global: 15^th place; English: 8^th place)

api.semanticscholar.org

Rojas, Raúl (1 February 2014). "Konrad Zuse und der bedingte Sprung" [Konrad Zuse and the conditional jump]. Informatik-Spektrum (in German). 37 (1): 50–53. doi:10.1007/s00287-013-0717-9. ISSN 0170-6012. S2CID 1086397.
Schmidhuber, Jürgen (1997), "A computer scientist's view of life, the universe, and everything", in Freksa, Christian; Jantzen, Matthias; Valk, Rüdiger (eds.), Foundations of Computer Science: Potential — Theory — Cognition, Lecture Notes in Computer Science, vol. 1337, Springer, pp. 201–8, arXiv:quant-ph/9904050, doi:10.1007/bfb0052088, ISBN 978-3-540-69640-7, S2CID 17830241
Shah, Shalin; Wee, Jasmine; Song, Tianqi; Ceze, Luis; Strauss, Karin; Chen, Yuan-Jyue; Reif, John (4 May 2020). "Using Strand Displacing Polymerase To Program Chemical Reaction Networks". Journal of the American Chemical Society. 142 (21): 9587–93. doi:10.1021/jacs.0c02240. ISSN 0002-7863. PMID 32364723. S2CID 218504535.

seriot.ch (Global: low place; English: low place)

"Jira is Turing-Complete". seriot.ch. Retrieved 23 May 2026.
"Unicode's Transliteration Rules Are Turing-Complete". seriot.ch. Retrieved 8 July 2026.

stedolan.net (Global: low place; English: low place)

Dolan, Stephen. "mov is Turing-complete" (PDF). stedolan.net. Archived from the original (PDF) on 14 February 2021. Retrieved 9 May 2019.

themarysue.com (Global: 3,399^th place; English: 2,031^st place)

Cedotal, Andrew (16 April 2010). "Man Uses World's Most Difficult Computer Game to Create … A Working Turing Machine". The Mary Sue. Archived from the original on 27 June 2015. Retrieved 2 June 2015.

twitter.com (Global: 43^rd place; English: 43^rd place)

"Habbo's Twitter thread on the implementation of a Turing machine inside the game". 9 November 2020. Retrieved 11 November 2020.

unidex.com (Global: low place; English: low place)

Lyons, Bob (30 March 2001). "Universal Turing Machine in XSLT". B2B Integration Solutions from Unidex. Archived from the original on 17 July 2011. Retrieved 5 July 2010.

utexas.edu (Global: 868^th place; English: 634^th place)

cs.utexas.edu

Boyer, Robert S.; Moore, J. Strother (May 1983). A Mechanical Proof of the Turing Completeness of Pure Lisp (PDF) (Technical report). Institute for Computing Science, University of Texas at Austin. 37. Archived (PDF) from the original on 22 September 2017.

web.archive.org (Global: 1^st place; English: 1^st place)

Lyons, Bob (30 March 2001). "Universal Turing Machine in XSLT". B2B Integration Solutions from Unidex. Archived from the original on 17 July 2011. Retrieved 5 July 2010.
Boyer, Robert S.; Moore, J. Strother (May 1983). A Mechanical Proof of the Turing Completeness of Pure Lisp (PDF) (Technical report). Institute for Computing Science, University of Texas at Austin. 37. Archived (PDF) from the original on 22 September 2017.
Cedotal, Andrew (16 April 2010). "Man Uses World's Most Difficult Computer Game to Create … A Working Turing Machine". The Mary Sue. Archived from the original on 27 June 2015. Retrieved 2 June 2015.
Churchill, Alex; Biderman, Stella; Herrick, Austin (2020). Magic: The Gathering Is Turing Complete (PDF). 10th International Conference on Fun with Algorithms. Archived from the original (PDF) on 23 September 2025.
Kaye, Richard (31 May 2007). "Infinite versions of minesweeper are Turing complete" (PDF). Archived from the original (PDF) on 3 August 2016. Retrieved 8 July 2016.
Dolan, Stephen. "mov is Turing-complete" (PDF). stedolan.net. Archived from the original (PDF) on 14 February 2021. Retrieved 9 May 2019.

worldcat.org (Global: 4^th place; English: 4^th place)

search.worldcat.org

Rojas, Raúl (1 February 2014). "Konrad Zuse und der bedingte Sprung" [Konrad Zuse and the conditional jump]. Informatik-Spektrum (in German). 37 (1): 50–53. doi:10.1007/s00287-013-0717-9. ISSN 0170-6012. S2CID 1086397.
Meyers, Scott (Scott Douglas) (2005). Effective C++: 55 specific ways to improve your programs and designs (3rd ed.). Upper Saddle River, NJ: Addison-Wesley. ISBN 0-321-33487-6. OCLC 60425273.
Shah, Shalin; Wee, Jasmine; Song, Tianqi; Ceze, Luis; Strauss, Karin; Chen, Yuan-Jyue; Reif, John (4 May 2020). "Using Strand Displacing Polymerase To Program Chemical Reaction Networks". Journal of the American Chemical Society. 142 (21): 9587–93. doi:10.1021/jacs.0c02240. ISSN 0002-7863. PMID 32364723. S2CID 218504535.
Srinivas, Niranjan; Parkin, James; Seelig, Georg; Winfree, Erik; Soloveichik, David (15 December 2017). "Enzyme-free nucleic acid dynamical systems". Science. 358 (6369) eaal2052. doi:10.1126/science.aal2052. ISSN 0036-8075. PMID 29242317.

youtube.com (Global: 13^th place; English: 14^th place)

GD Colon (20 December 2025). Yes, Geometry Dash is a Game Engine. Retrieved 8 September 2026 – via YouTube.
Break Me00 The MoVfuscator Turning mov into a soul crushing RE nightmare Christopher Domas, 25 September 2015, retrieved 5 November 2022

Turing completeness (English Wikipedia)

acm.org (Global: 1,200th place; English: 821st place)

dl.acm.org

adsabs.harvard.edu (Global: 14th place; English: 9th place)

ui.adsabs.harvard.edu

amazonaws.com (Global: 3,611th place; English: 2,190th place)

terra-docs.s3.us-east-2.amazonaws.com

archive.org (Global: 6th place; English: 6th place)

arstechnica.com (Global: 473rd place; English: 338th place)

arxiv.org (Global: 49th place; English: 31st place)

bham.ac.uk (Global: 6,455th place; English: 3,713th place)

web.mat.bham.ac.uk

books.google.com (Global: 3rd place; English: 3rd place)

doi.org (Global: 2nd place; English: 2nd place)

emis.de (Global: low place; English: low place)

cs.emis.de

hackaday.com (Global: low place; English: 7,931st place)

ioccc.org (Global: low place; English: low place)

itnext.io (Global: low place; English: low place)

kotaku.com (Global: 460th place; English: 318th place)

litherum.blogspot.com (Global: low place; English: low place)

microsoft.com (Global: 263rd place; English: 259th place)

techcommunity.microsoft.com

nih.gov (Global: 5th place; English: 5th place)

pubmed.ncbi.nlm.nih.gov

ncbi.nlm.nih.gov

odu.edu (Global: low place; English: 7,704th place)

cs.odu.edu

postgresql.org (Global: low place; English: low place)

wiki.postgresql.org

researchgate.net (Global: 96th place; English: 89th place)

rockpapershotgun.com (Global: 1,189th place; English: 738th place)

semanticscholar.org (Global: 15th place; English: 8th place)

api.semanticscholar.org

seriot.ch (Global: low place; English: low place)

stedolan.net (Global: low place; English: low place)

themarysue.com (Global: 3,399th place; English: 2,031st place)

twitter.com (Global: 43rd place; English: 43rd place)

unidex.com (Global: low place; English: low place)

utexas.edu (Global: 868th place; English: 634th place)

cs.utexas.edu

web.archive.org (Global: 1st place; English: 1st place)

worldcat.org (Global: 4th place; English: 4th place)

search.worldcat.org

youtube.com (Global: 13th place; English: 14th place)

acm.org (Global: 1,200^th place; English: 821^st place)

adsabs.harvard.edu (Global: 14^th place; English: 9^th place)

amazonaws.com (Global: 3,611^th place; English: 2,190^th place)

archive.org (Global: 6^th place; English: 6^th place)

arstechnica.com (Global: 473^rd place; English: 338^th place)

arxiv.org (Global: 49^th place; English: 31^st place)

bham.ac.uk (Global: 6,455^th place; English: 3,713^th place)

books.google.com (Global: 3^rd place; English: 3^rd place)

doi.org (Global: 2^nd place; English: 2^nd place)

hackaday.com (Global: low place; English: 7,931^st place)

kotaku.com (Global: 460^th place; English: 318^th place)

microsoft.com (Global: 263^rd place; English: 259^th place)

nih.gov (Global: 5^th place; English: 5^th place)

odu.edu (Global: low place; English: 7,704^th place)

researchgate.net (Global: 96^th place; English: 89^th place)

rockpapershotgun.com (Global: 1,189^th place; English: 738^th place)

semanticscholar.org (Global: 15^th place; English: 8^th place)

themarysue.com (Global: 3,399^th place; English: 2,031^st place)

twitter.com (Global: 43^rd place; English: 43^rd place)

utexas.edu (Global: 868^th place; English: 634^th place)

web.archive.org (Global: 1^st place; English: 1^st place)

worldcat.org (Global: 4^th place; English: 4^th place)

youtube.com (Global: 13^th place; English: 14^th place)