Authors
Ramón Casares
Universidad Politecnica de Madrid (PhD)
Abstract
Why are we so many? Or, in other words, Why is our species so successful? The ultimate cause of our success as species is that we, Homo sapiens, are the first and the only Turing complete species. Turing completeness is the capacity of some hardware to compute by software whatever hardware can compute. To reach the answer, I propose to see evolution and computing from the problem solving point of view. Then, solving more problems is evolutionarily better, computing is for solving problems, and software is much cheaper than hardware, resulting that Turing completeness is evolutionarily disruptive. This conclusion, together with the fact that we are the only Turing complete species, is the reason that explains why we are so many. Most of our unique cognitive characteristics as humans can be derived from being Turing complete, as for example our complete language and our problem solving creativity.
Keywords Turing completeness  problem solving  cognition  evolution  hardware and software
Categories (categorize this paper)
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

 PhilArchive page | Other versions
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

A Mathematical Model of Quantum Computer by Both Arithmetic and Set Theory.Vasil Penchev - 2020 - Information Theory and Research eJournal 1 (15):1-13.
The Annotation Game: On Turing (1950) on Computing, Machinery, and Intelligence.Stevan Harnad - 2006 - In Robert Epstein & Grace Peters (eds.), [Book Chapter] (in Press). Kluwer Academic Publishers.
Turing's Golden: How Well Turing's Work Stands Today.Justin Leiber - 2006 - Philosophical Psychology 19 (1):13-46.
A Brief Critique of Pure Hypercomputation.Paolo Cotogno - 2009 - Minds and Machines 19 (3):391-405.
Post's Problem for Reducibilities of Bounded Complexity.Valeriy K. Bulitko - 2002 - Mathematical Logic Quarterly 48 (3):367-373.
Letter to Turing.Giuseppe Longo - 2019 - Theory, Culture and Society 36 (6):73-94.
Accelerating Turing Machines.B. Jack Copeland - 2002 - Minds and Machines 12 (2):281-300.
The Turing Test.B. Jack Copeland - 2000 - Minds and Machines 10 (4):519-539.
Turing and the Evaluation of Intelligence.Francesco Bianchini - 2014 - Isonomia: Online Philosophical Journal of the University of Urbino:1-18.

Analytics

Added to PP index
2021-06-09

Total views
37 ( #284,949 of 2,439,023 )

Recent downloads (6 months)
37 ( #20,017 of 2,439,023 )

How can I increase my downloads?

Downloads

My notes