The x86 language has Turing Complete memory access

Abstract

An abstract machine having a tape head that can be advanced in 0 to 0x7FFFFFFF increments an unlimited number of times specifies a model of computation that has access to unlimited memory. The technical name for memory addressing based on displacement from the current memory address is relative addressing.

Categories

Keywords

Reprint years

Links

PhilArchive

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

My notes

Similar books and articles

Turing's golden: How well Turing's work stands today.Justin Leiber - 2006 - Philosophical Psychology 19 (1):13-46.
Computation in cognitive science: it is not all about Turing-equivalent computation.Kenneth Aizawa - 2010 - Studies in History and Philosophy of Science Part A 41 (3):227-236.
The Church-Turing Thesis.B. Jack Copeland - 2014 - In Edward N. Zalta (ed.), The Stanford Encyclopedia of Philosophy. Stanford, CA: The Metaphysics Research Lab.
The Turing test.B. Jack Copeland - 2000 - Minds and Machines 10 (4):519-539.
From Symbol to ‘Symbol’, to Abstract Symbol: Response to Copeland and Shagrir on Turing-Machine Realism Versus Turing-Machine Purism.Eli Dresner & Ofra Rechter - 2016 - Minds and Machines 26 (3):253-257.
On Alan Turing's anticipation of connectionism.Jack Copeland - 1996 - Synthese 108 (3):361-377.
Turing’s Test: A Philosophical and Historical Guide.Diane Proudfoot & Jack Copeland - 2008 - In R. Epstein, G. Roberts & G. Beber (eds.), Parsing the Turing Test: Philosophical and Methodological Issues. Springer. pp. 119-138.
S. Barry Cooper and Andrew Hodges , The Once and Future Turing: Computing the World. Cambridge University Press, 2016. xviii + 379 pp.— therein: - Martin Davis. Algorithms, Equations, and Logic. pp. 4–19. - J.M.E. Hyland. The Forgotten Turing. pp. 20–33. - Andrew R. Booker. Turing and the Primes. pp. 34–52. - Ueli Maurer. Cryptography and Computation after Turing. pp. 53–77. - Kanti V. Mardia and S. Barry Cooper. Alan Turing and Enigmatic Statistics. pp. 78–89. - Stephen Wolfram. What Alan Turing Might Have Discovered. pp. 92–105. - Christof Teuscher. Designed versus Intrinsic Computation. pp. 106–116. - Solomon Feferman. Turing’s ‘Oracle’: From Absolute to Relative Computability and Back. pp. 300–334. - P.D. Welch. Turing Transcendent: Beyond the Event Horizon. pp. 335–360. - Roger Penrose. On Attempting to Model the Mathematical Mind. pp. 361–378. [REVIEW]Alasdair Urquhart - 2016 - Bulletin of Symbolic Logic 22 (3):354-356.
The Logic of Turing Progressions.Eduardo Hermo Reyes & Joost J. Joosten - 2020 - Notre Dame Journal of Formal Logic 61 (1):155-180.
Turing degrees of certain isomorphic images of computable relations.Valentina S. Harizanov - 1998 - Annals of Pure and Applied Logic 93 (1-3):103-113.
On Turing's Turing test and why the matter matters.Justin Leiber - 1995 - Synthese 104 (1):59-69.
Turing, Matthews and Millikan: Effective Memory, Dispositionalism and Pushmepullyou Mental States.Eli Dresner - 2012 - International Journal of Philosophical Studies 20 (4):461-472.
A Mathematical Model of Quantum Computer by Both Arithmetic and Set Theory.Vasil Penchev - 2020 - Information Theory and Research eJournal 1 (15):1-13.
Turing and the Serendipitous Discovery of the Modern Computer.Aurea Anguera de Sojo, Juan Ares, Juan A. Lara, David Lizcano, María A. Martínez & Juan Pazos - 2013 - Foundations of Science 18 (3):545-557.
Neural and super-Turing computing.Hava T. Siegelmann - 2003 - Minds and Machines 13 (1):103-114.

Analytics

Added to PP
2020-08-25

Downloads
173 (#107,898)

6 months
51 (#79,015)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references