Results 111 to 120 of about 3,677,609 (156)
Does formal complexity reflect cognitive complexity? Investigating aspects of the Chomsky Hierarchy in an artificial language learning study. [PDF]
Öttl B, Jäger G, Kaup B.
europepmc +1 more source
Computability, Gödel's incompleteness theorem, and an inherent limit on the predictability of evolution. [PDF]
Day T.
europepmc +1 more source
Implicit learning of recursive context-free grammars. [PDF]
Rohrmeier M, Fu Q, Dienes Z.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
A Note on the Recursive Enumerability of Some Classes of Recursively Enumerable Languages
Information Sciences, 1978Abstract An elementary proof is presented for the fact that the class of infinite recursive languages is not recursively enumerable. Its relevance for contemporary linguistics and computer science is explained.
Paul Vitanyi
exaly +4 more sources

