Resolution Machinery

Casares, Ramón (2014) Resolution Machinery. [Preprint]

Full text available as:



The value of syntax is controversial: some see syntax as defining us as species, while for others it just facilitates communication. To assess syntax we investigate its relation to problem resolving. First we define a problem theory from first principles, and then we translate the theory concepts to mathematics, obtaining the requirements that every resolution machine has to implement. Such a resolution machine will be able to execute any possible resolution, that is, any possible way of taking a problem expression and computing the problem solutions. Two main requirements are found: 1) syntax is needed to express problems, that is, separate words are not enough, and 2) the resolution machine has to be as powerful as lambda calculus is, that is, it has to be Turing complete. Noting that every device that can generate any possible syntax, that is, any possible syntactically correct sentence of any possible, natural or artificial, language, has to be Turing complete, we conclude that syntax and problem resolving can use the same components, as, for example, sentences, functions, and conditionals. The implication to human evolution is that syntax and problem resolving should have co-evolved in humans towards Turing completeness.

Item Type:Preprint
Keywords:syntax evolution, problem resolving, Turing completeness
Subjects:Biology > Evolution
Computer Science > Language
Linguistics > Syntax
ID Code:9209
Deposited By: Casares, Dr Ramón
Deposited On:11 Mar 2014 11:55
Last Modified:02 May 2014 11:51

References in Article

Select the SEEK icon to attempt to find the referenced article. If it does not appear to be in cogprints you will be forwarded to the paracite service. Poorly formated references will probably not work.

[Abelson and Sussman 1985] Harold Abelson, Gerald Sussman, Julie Sussman, "Structure and Interpretation of Computer Programs"; The MIT Press, Cambridge MA, 1985, ISBN 978-0-262-01077-1.

[Arbib 1987] Michael Arbib, "Brains, Machines, and Mathematics", Second Edition; Springer-Verlag, New York, 1987, ISBN 978-0-387-96539-0.

[Bickerton 2009] Derek Bickerton, "Adam's Tongue: How Humans Made Language, How Language Made Humans"; Hill and Wang, New York, 2009, ISBN 978-0-8090-1647-1.

[Casares 1993] Ramón Casares, "Ingeniería del aprendizaje: Hacia una teoría formal y fundamental del aprendizaje"; Universidad Politécnica de Madrid, 1993 (in Spanish).

[Casares 1999] Ramón Casares, "El problema aparente: Una teoría del conocimiento"; Visor Dis., Madrid, 1999, ISBN 978-84-7774-877-9 (in Spanish).

[Casares 2010] Ramón Casares, "El doble compresor: La teoría de la información";, 2010, ISBN 978-1-4536-0915-6 (in Spanish).

[Casares 2012] Ramón Casares, "On Freedom: The Theory of Subjectivity";, 2012, ISBN 978-1-4752-8739-4.

[Chomsky 1959] Noam Chomsky, "On Certain Formal Properties of Grammars"; in Information and Control, Volume 2, Issue 2, pp. 137-167, June 1959.

[Chomsky 2000] Noam Chomsky, "New Horizons in the Study of Language and Mind"; Cambridge University Press, Cambridge, 2000, ISBN 978-0-521-65822-5.

[Church 1935] Alonzo Church, "An Unsolvable Problem of Elementary Number Theory"; in American Journal of Mathematics, Vol. 58, No. 2 (Apr., 1936), pp. 345-363. Presented to the American Mathematical Society, April 19, 1935.

[Hauser, Chomsky, and Fitch 2002] Marc Hauser, Noam Chomsky, Tecumseh Fitch, "The Language Faculty: Who Has It, What Is It, and How Did It Evolved?"; in Science 298, pp. 1569-1579, 2002.

[Kenneally 2007] Christine Kenneally, "The First Word: The Search for the Origins of Language"; Penguin Books, New York, 2008, ISBN 978-0-14-311374-4.

[Turing 1936] Alan Turing, "On Computable Numbers, with an Application to the Entscheidungsproblem"; in Proceedings of the London Mathematical Society, Volume s2-42, Issue 1, pp 230-265, 1937. Received 28 May, 1936. Read 12 November, 1936.


Repository Staff Only: item control page