Natural recursion doesn’t work that way: automata in planning and syntax

Date

2016-01-01

Author

Bozşahin, Hüseyin Cem

Metadata

Show full item record

Item Usage Stats

128
views

0
downloads

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.

Subject Keywords

Recursion, Syntax, Planning, Mind and computation

URI

https://hdl.handle.net/11511/78575
https://link.springer.com/chapter/10.1007/978-3-319-26485-1_7

Relation

Fundamental issues in Artificial Intelligence

Collections

Graduate School of Informatics, Book / Book chapter

Suggestions

OpenMETU
Core

Time-dependent recursion operators and symmetries Gurses, M; Karasu, Atalay; Turhan, R (Informa UK Limited, 2002-05-01) The recursion operators and symmetries of nonautonomous, (1 + 1) dimensional integrable evolution equations are considered. It has been previously observed hat he symmetries of he integrable evolution equations obtained through heir recursion operators do not satisfy the symmetry equations. There have been several attempts to resolve his problem. It is shown that in the case of time-dependent evolution equations or time-dependent recursion operators associativity is lost. Due to this fact such recursion ope...
Bounded factorization property for ℓ-Köthe spaces Yurdakul, Murat Hayrettin; Taştüner, Emre (2023-01-01) Let ℓ denote a Banach sequence space with a monotone norm in which the canonical system (en )n is an unconditional basis. We show that the existence of an unbounded continuous linear operator T between ℓ-Köthe spaces λℓ (A) and λℓ (C) which factors through a third ℓ-Köthe space λℓ (B) causes the existence of an unbounded continuous quasidiagonal operator from λℓ (A) into λℓ (C) factoring through λℓ (B) as a product of two continuous quasidiagonal operators. Using this result, we study when the triple (λℓ (A...
Merge: Binarity in (Multidominant) Syntax Citko, Barbara; Gracanın Yüksek, Martına (The MIT Press, Cambridge (MA), USA , 2021-02-01) An argument that Merge is binary but its binarity refers to syntactic positions rather than objects. In this book, Barbara Citko and Martina Gračanin-Yuksek examine the constraints on Merge—the basic structure-building operation in minimalist syntax—from a multidominant perspective. They maintain that Merge is binary, but argue that the binarity of Merge refers to syntactic positions Merge relates: what has typically been formulated as a constraint that prevents Merge from combining more than two syntactic...
Efficient multiplications in F(5)5n and F(7)7n Cenk, Murat; Özbudak, Ferruh (2011-08-15) Efficient multiplications in finite fields of characteristics 5 and 7 are used for computing the Eta pairing over divisor class groups of the hyperelliptic curves Lee et al. (2008) [1]. In this paper, using the recent methods for multiplication in finite fields, the explicit formulas for multiplication in F(5)5n and F(7)7n are obtained with 10 multiplications in F(5)n for F(5)5n and 15 multiplications in F(7)n for F(7)7n improving the results in Cenk and Ozbudak (2008) [4], Cenk et al. (2009) [5], Lee et al...
Generalized nonbinary sequences with perfect autocorrelation, flexible alphabets and new periods BOZTAŞ, Serdar; Özbudak, Ferruh; TEKİN, Eda (Springer Science and Business Media LLC, 2018-05-01) We extend the parameters and generalize existing constructions of perfect autocorrelation sequences over complex alphabets. In particular, we address the PSK+ constellation (Boztas and Udaya 2010) and present an extended number theoretic criterion which is sufficient for the existence of the new sequences with perfect autocorrelation. These sequences are shown to exist for nonprime alphabets and more general lengths in comparison to existing designs. The new perfect autocorrelation sequences provide novel a...

Citation Formats

H. C. Bozşahin, Natural recursion doesn’t work that way: automata in planning and syntax. 2016, p. 112.