Natural Recursion Doesn’t Work That Way: Automata in Planning and Syntax

In Vincent C. Müller (ed.), Fundamental Issues of Artificial Intelligence. Cham: Springer. pp. 95-112 (2016)
  Copy   BIBTEX

Abstract

Natural recursion in syntax is recursion by linguistic value, which is not syntactic in nature but semantic. Syntax-specific recursion is not recursion by name as the term is understood in theoretical computer science. Recursion by name is probably not natural because of its infinite typeability. Natural recursion, or recursion by value, is not species-specific. Human recursion is not syntax-specific. The values on which it operates are most likely domain-specific, including those for syntax. Syntax seems to require no more (and no less) than the resource management mechanisms of an embedded push-down automaton (EPDA). We can conceive EPDA as a common automata-theoretic substrate for syntax, collaborative planning, i-intentions, and we-intentions. They manifest the same kind of dependencies. Therefore, syntactic uniqueness arguments for human behavior can be better explained if we conceive automata-constrained recursion as the most unique human capacity for cognitive processes.

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

Similar books and articles

Weak cardinality theorems.Till Tantau - 2005 - Journal of Symbolic Logic 70 (3):861-878.
Weak Cardinality Theorems.Till Tantau - 2005 - Journal of Symbolic Logic 70 (3):861 - 878.
Is the brain a digital computer?John R. Searle - 1990 - Proceedings and Addresses of the American Philosophical Association 64 (3):21-37.
Term rewriting theory for the primitive recursive functions.E. A. Cichon & Andreas Weiermann - 1997 - Annals of Pure and Applied Logic 83 (3):199-223.
Relating word and tree automata.Orna Kupferman, Shmuel Safra & Moshe Y. Vardi - 2006 - Annals of Pure and Applied Logic 138 (1):126-146.
Safe recursion with higher types and BCK-algebra.Martin Hofmann - 2000 - Annals of Pure and Applied Logic 104 (1-3):113-166.
Iterating semantic automata.Shane Steinert-Threlkeld & I. I. I. Thomas F. Icard - 2013 - Linguistics and Philosophy 36 (2):151-173.
The equivalence of bar recursion and open recursion.Thomas Powell - 2014 - Annals of Pure and Applied Logic 165 (11):1727-1754.
Linear logic automata.Max I. Kanovich - 1996 - Annals of Pure and Applied Logic 78 (1-3):147-188.
Recursion theory for metamathematics.Raymond Merrill Smullyan - 1993 - New York: Oxford University Press.

Analytics

Added to PP
2019-01-28

Downloads
181 (#105,220)

6 months
85 (#49,656)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Cem Bozsahin
Middle East Technical University

Citations of this work

No citations found.

Add more citations

References found in this work

Collective Intentions and Actions.John Searle - 1990 - In Philip R. Cohen Jerry Morgan & Martha Pollack (eds.), Intentions in Communication. MIT Press. pp. 401-415.
Primate Cognition.Michael Tomasello & Josep Call - 1997 - Oxford University Press USA.
Shared cooperative activity.Michael E. Bratman - 1992 - Philosophical Review 101 (2):327-341.

View all 16 references / Add more references