The human mind is equivalent in computational capacity to a Turing machine.
the verdict
CONTESTED PARTIAL
refutedsupported
the weight of evidence
3 sources for · 1 against
The retrieved literature shows that while computationalism posits that the human mind can be modeled using mechanisms broadly equivalent to Turing machines, this premise remains heavily debated, with counter-arguments noting that human cognitive processes may not always be entirely algorithmic.
Does the Principle of Computational Equivalence Overcome the Objections against Computationalism? | Springer Nature Link Skip to main content Advertisement Does the Principle of Computational Equivalence Overcome the Objections against Computationalism? Chapter pp 225–233 Cite this chapter Save chapter View saved research Computing Nature Abstract Computationalism has been variously defined as the idea that the human mind can be modelled by means of mechanisms broadly equivalent to Turing Machines. Computationalism’s claims have been hotly debated and arguments against and for have drawn extensively from mathematics, cognitive sciences and philosophy, although the debate is hardly settled.
On the other hand, in his 2002 book New Kind of Science, Stephen Wolfram advanced what he called the Principle of Computational Equivalence (PCE), whose main contention is that fairly simple systems can easily reach very complex behaviour and become as powerful as any possible system based on rules (that is, they are computationally equivalent). He also claimed that any natural (and even human) phenomenon can be explained as the interaction of very simple rules. Of course, given the universality of Turing Machine-like mechanisms, PCE could be considered simply a particular brand of computationalism, subject to the same objections as previous attempts.
In this paper we analyse in depth if this view of PCE is justified or not and hence if PCE can overcome some criticisms and be a different and better model of the human mind. This is a preview of subscription content, log in via an institution to check access.
Cartographies of the Mind, Chapter 3, 37–49 (2007) Article Google Scholar Dodig-Crnkovic, G., Mueller, V.: A dialogue concerning two world systems: info-computational vs. mechanistic. In: Dodig Crnkovic, G., Burgin, M. (eds.) Information and Computation, pp. 149–184. World Scientific Publishing Co., Inc., Singapore (2009) Google Scholar Dodig-Crnkovic, G.: Biological Information and Natural Computation. In: Vallverdú, J. (ed.) Thinking Machines and the Philosophy of Computer Science: Concepts and Principles, Information Science Reference. IGI Global, Hershey (2010) Google Scholar Dodig-Crnkovik, G.: Dynamics of Information as Natural Computation.
MIT Press, Cambridge (1981) Google Scholar Fodor, J.A.: Theory of Content and Other Essays. MIT Press, Cambridge (1990) Google Scholar Fodor, J.A.: The Elm and the Expert. MIT Press, Cambridge (1993) Google Scholar Fodor, J.A.: Concepts. Clarendon Press, Oxford (1998) Book Google Scholar Garrido, A.: Connectionism vs. Computationalism Theory of Mind. BRAIN (Broad Research in Artificial Intelligence and Neuroscience) 1(1) (2010) Google Scholar Horst, S.: Mind Computationalism Theory. University of California Press, Berkeley (1986) Google Scholar Horst, S.: Symbols, Computation and Intentionality: A Critique of the Computational Theory of Mind.
University of California Press, Berkeley (1996) Google Scholar The Stanford Encyclopedia of Philosophy, http://plato.stanford.edu/ Kelemen, J., Alica, K.: The New Computationalism: a Lesson from Embodied Agents. Silesram University, Institute of Computer Science Press, Opava, Slovakia (2008) Google Scholar McCulloch, W.S., Pitts, W.H.: A Logical Calculus of the Ideas Immanent in Nervous Activity. Bulletin of Mathematical Biophysics 7, 115–133 (1943) Article MathSciNet Google Scholar Piccinini, G.: The first Computational theory of mind and brain: a close look at McCulloch and Pitts’s Logical calculus of ideas immanent in nervous activity.
7, University of Minnesota Press, Minneapolis (1975) Google Scholar Sayre, K.: Intentionality and information processing: An alternative model for cognitive science. Behavioral and Brain Sciences 9(1), 121–138 (1986) Article Google Scholar Searle, J.: Minds, brains and programs. Behavioral and Brain Sciences 3, 417–424 (1980) Article Google Scholar Searle, J.: Is the Brain a digital computer? Proceedings and Addresses of American Philosophical Association 64, 21–37 (1990) Article Google Scholar Smith, A.: Universality of Wolfram’s 2,3 Turing Machine (2007) Google Scholar Sutner, K.: Cellular automata and intermediate degrees.
Theoretical Computer Science 296, 365–375 (2003) Article MathSciNet MATH Google Scholar Sutner, K.: Universality and Cellular Automata. MCU, 50–59 (2004) Google Scholar Turing, A.M.: Lecture to the London Mathematical Society on 20 February 1947. In: Ince, D. (ed.) Mechanical Intelligence, pp. 87–105. North-Holland, Amsterdam (1947) Google Scholar Turing, A.M.: Intelligent Machinery. In: Ince, D. (ed.) Mechanical Intelligence, pp. 87–106. North-Holland, Amsterdam (1948) Google Scholar Turing, A.M.: Computing machinery and intelligence. Mind 59, 433–460 (1950) Article MathSciNet Google Scholar
also argues that the human mind is not always algorithmic on the basis of its capacity to prove incompleteness … which they have to a greater or lesser extent thought through and which they suggest to a student leaving … the 1936 Universal Turing Machine, were in operation. This was already giving rise to a powerful paradigm
The once and future Turing : computing the world : Free Download, Borrow, and Streaming : Internet Archive Skip to main content Keep the news in the Wayback Machine. Sign Fight for the Future's letter .
Occupy Wall Street TV NSA Clip Library Top Animation & Cartoons Arts & Music Computers & Technology Cultural & Academic Films Ephemeral Films Movies News & Public Affairs Spirituality & Religion Sports Videos Television Videogame Videos Vlogs Youth Media Search the history of more than 1 trillion web pages . Search the Wayback Machine Mobile Apps Wayback Machine (iOS) Wayback Machine (Android) Browser Extensions Chrome Firefox Safari Edge Archive-It Subscription Explore the Collections Learn More Build Collections Save Page Now Capture a web page as it appears now for use as a trusted citation in the future.
Enter a URL to save Please enter a valid web address About Blog Events Projects Help Donate Contact Jobs Volunteer About Blog Events Projects Help Donate Contact Jobs Volunteer The once and future Turing : computing the world Bookreader Item Preview remove-circle Share or Embed This Item Share to Twitter Share to Facebook Share to Reddit Share to Tumblr Share to Pinterest Share via email Copy Link EMBED EMBED (for Archive.org item Description fields) [archiveorg oncefutureturing0000unse width=560 height=384 frameborder=0 webkitallowfullscreen=true mozallowfullscreen=true] Want more? Advanced embedding details, examples, and help !
Favorite Share Flag Flag this item for Graphic Violence Explicit Sexual Content Hate Speech Misinformation/Disinformation Marketing/Phishing/Advertising Misleading/Inaccurate/Missing Metadata texts The once and future Turing : computing the world Publication date 2016 Topics Turing, Alan Mathison, 1912-1954 , Mathematics -- Great Britain -- History -- 20th century , Computer science -- Great Britain -- History -- 20th century , Cryptography -- Great Britain -- History -- 20th century Publisher Cambridge, UK : Cambridge University Press Collection internetarchivebooks ; printdisabled Contributor Internet Archive Language English Item Size 777.5M xviii, 379 pages : 26 cm "Alan Turing (1912-1954) made seminal contributions to mathematical logic, computation, computer science, artificial intelligence, cryptography and theoretical biology.
In this volume, outstanding scientific thinkers take a fresh look at the great range of Turing's contributions, on how the subjects have developed since his time, and how they might develop still further. The contributors include Martin Davis, J. M. E. Hyland, Andrew R. Booker, Ueli Maurer, Kanti V. Mardia, S. Barry Cooper, Stephen Wolfram, Christof Teuscher, Douglas Richard Hofstadter, Philip K. Maini, Thomas E. Woolley, Eamonn A. Gaffney, Ruth E. Baker, Richard Gordon, Stuart Kauffman, Scott Aaronson, Solomon Feferman, P. D. Welch and Roger Penrose.
These specially commissioned essays will provoke and engross the reader who wishes to understand better the lasting significance of one of the twentieth century's deepest thinkers."--Amazon.com Includes bibliographical references Preface -- Introduction -- Part One: Inside our computable world, and the mathematics of universality. Algorithms, equations, and logic ; The forgotten Turing ; Turing and the primes ; Cryptography and computation after Turing ; Alan Turing and enigmatic statistics -- Part Two: The computation of processes, and not computing the brain.
What Alan Turing might have discovered ; Designed versus intrinsic computation ; Dull rigid human meets ace mechanical translator -- Part Three: The reverse engineering road to computing life. Turing's theory of developmental pattern formation ; Walking tightrope: the dilemma of hierarchical instabilities in Turing's morphogenesis -- Part Four: Biology, mind, and the outer reaches of quantum computation. Answering Descartes: beyond Turing ; The ghost in the quantum Turing machine -- Part Five: Oracles, infinitary computation, and the physics of the mind.
Turing's 'Oracle': from absolute to relative computability and back ; Turing transcendent: beyond the event horizon ; On attempting to model the mathematical mind -- Afterword Access-restricted-item true Addeddate 2022-01-01 14:31:55 Associated-names Cooper, S. B. (S.
terms of a Turing machine. If the networks rely on continuous values, the values are Turing-machine computable … has the capacity to compute or manipulate them. Under this proposal, the agent has access to a represen- … thinking)” and (2) “our capacity to think about things reasonably amounts to a faculty for internal ‘automatic’
Explaining the computational mind : Mi¿kowski, Marcin : Free Download, Borrow, and Streaming : Internet Archive Skip to main content Keep the news in the Wayback Machine. Sign Fight for the Future's letter .
Occupy Wall Street TV NSA Clip Library Top Animation & Cartoons Arts & Music Computers & Technology Cultural & Academic Films Ephemeral Films Movies News & Public Affairs Spirituality & Religion Sports Videos Television Videogame Videos Vlogs Youth Media Search the history of more than 1 trillion web pages . Search the Wayback Machine Mobile Apps Wayback Machine (iOS) Wayback Machine (Android) Browser Extensions Chrome Firefox Safari Edge Archive-It Subscription Explore the Collections Learn More Build Collections Save Page Now Capture a web page as it appears now for use as a trusted citation in the future.
Enter a URL to save Please enter a valid web address About Blog Events Projects Help Donate Contact Jobs Volunteer About Blog Events Projects Help Donate Contact Jobs Volunteer Explaining the computational mind Bookreader Item Preview remove-circle Share or Embed This Item Share to Twitter Share to Facebook Share to Reddit Share to Tumblr Share to Pinterest Share via email Copy Link EMBED EMBED (for Archive.org item Description fields) [archiveorg explainingcomput0000miko width=560 height=384 frameborder=0 webkitallowfullscreen=true mozallowfullscreen=true] Want more? Advanced embedding details, examples, and help !
Favorite Share Flag Flag this item for Graphic Violence Explicit Sexual Content Hate Speech Misinformation/Disinformation Marketing/Phishing/Advertising Misleading/Inaccurate/Missing Metadata texts Explaining the computational mind by Mi¿kowski, Marcin Publication date 2013 Topics Cognitive neuroscience -- Data processing , Computational neuroscience , Computational complexity Publisher Cambrid, Massachusetts : The MIT Press Collection internetarchivebooks ; nationaluniversity ; inlibrary ; printdisabled Contributor Internet Archive Language English x, 243 pages ; 24 cm Includes bibliographical references (pages 209-232) and index Computation in cognitive science : four case studies and a funeral -- Computational processes -- Computational explanation -- Computation and representation -- Limits of computational explanation Access-restricted-item true Addeddate 2023-06-01 21:13:03 Autocrop_version 0.0.15_books-20220331-0.2 Boxid IA40954121 Camera Sony Alpha-A6300 (Control) Col_number COL-2513 Collection_set printdisabled External-identifier urn:lcp:explainingcomput0000miko:epub:48350151-fcca-495c-8b6d-db993a59358f urn:lcp:explainingcomput0000miko:lcpdf:1a07f3b8-00a8-4a84-a068-43fa5b57cb88 urn:oclc:record:836864194 Foldoutcount 0 Identifier explainingcomput0000miko Identifier-ark ark:/13960/s2460w1z90s Invoice 1652 Isbn 9780262018869 0262018861 9780262313902 Lccn 2012036420 Ocr tesseract 5.3.0-3-g9920 Ocr_detected_lang en Ocr_detected_lang_conf 1.0000 Ocr_detected_script Latin Ocr_detected_script_conf 0.9952 Ocr_module_version 0.0.21 Ocr_parameters -l eng Old_pallet IA409497 Openlibrary_edition OL26178265M Openlibrary_work OL17575119W Page-progression lr Page_number_confidence 99 Page_number_module_version 1.0.5 Pages 266 Pdf_module_version 0.0.22 Ppi 360 Rcs_key 24143 Republisher_date 20230601222432 Republisher_operator associate-princess-ranario@archive.org Republisher_time 336 Scandate 20230529064151 Scanner station17.cebu.archive.org Scanningcenter cebu Scribe3_search_catalog isbn Scribe3_search_id 9780262018869 Tts_version 5.7-initial-22-g1996d085 Worldcat (source edition) 813540883 Show More Show Less Full catalog record MARCXML plus-circle Add Review comment Reviews 0 Previews 3 Favorites DOWNLOAD OPTIONS No suitable files to display here.
Computation separates time from space: nondeterministic problems are exponential in time (the "Time Dragon") but polynomially simulable in space (the "Space Dragon"), as formalized by Savitch's theorem (NPSPACE⊆PSPACE). We propose that the brain physically instantiates this theorem through Recursive Condensation, a topological mechanism that converts intractable high-dimensional search into efficient low-dimensional navigation. Drawing on Urysohn's Lemma, we demonstrate that separability is a property of connectivity, not volume; a stable decision boundary exists independent of ambient dimension provided the underlying manifolds are topologically disjoint. To manufacture this disjointness, the cortex employs a parity alternation strategy: it alternates between odd-parity metric expansion (exploratory search) to untangle local geometry, and even-parity topological contraction (closure/condensation) to lock in validated invariants. This cycle acts as a biological "Savitch Machine," mediating a Topological Trinity Transformation (TTT), <i>Search</i>→<i>Closure</i>→<i>Navigation</i>, that compiles high-entropy exploration paths into low-energy quotient tokens. Under Memory-Amortized Inference (MAI), the cortex slays the Space Dragon by collapsing vast state spaces into compact metric singularities, and tames the Time Dragon by memoizing these traversals as structural priors. Evolution's "cheat code," linear cortical growth yielding exponential cognitive gain, emerges as a physical law of topological inference: exponential search in time becomes polynomial reuse in space via recursive metric collapse.
Everything we examined (4) — 3 independent sources
This check searched the claim as stated. It did not run a separate search for evidence against it.