Search

The scope of human learning and development poses a radical challenge for cognitive science. We propose that developmental theories can address this challenge by adopting perspectives from computer science. Many of our best models treat learning as analogous to computer programming because symbolic programs provide the most compelling account of sophisticated mental representations. We specifically propose that children's learning is analogous to a particular style of programming called hacking, making code better along many dimensions through an open-ended set of goals and activities. By contrast to existing theories, which depend primarily on local search and simple metrics, this view highlights the many features of good mental representations and the multiple complementary processes children use to create them., (Copyright © 2020 The Authors. Published by Elsevier Ltd.. All rights reserved.)

Hierarchical cognitive mechanisms underlie sophisticated behaviors, including language, music, mathematics, tool‐use, and theory of mind. The origins of hierarchical logical reasoning have long been, and continue to be, an important puzzle for cognitive science. Prior approaches to hierarchical logical reasoning have often failed to distinguish between observable hierarchical behavior and unobservable hierarchical cognitive mechanisms. Furthermore, past research has been largely methodologically restricted to passive recognition tasks as compared to active generation tasks that are stronger tests of hierarchical rules. We argue that it is necessary to implement learning studies in humans, non‐human species, and machines that are analyzed with formal models comparing the contribution of different cognitive mechanisms implicated in the generation of hierarchical behavior. These studies are critical to advance theories in the domains of recursion, rule‐learning, symbolic reasoning, and the potentially uniquely human cognitive origins of hierarchical logical reasoning. [ABSTRACT FROM AUTHOR]

A major goal of linguistics and cognitive science is to understand what class of learning systems can acquire natural language. Until recently, the computational requirements of language have been used to argue that learning is impossible without a highly constrained hypothesis space. Here, we describe a learning system that is maximally unconstrained, operating over the space of all computations, and is able to acquire many of the key structures present in natural language from positive evidence alone. We demonstrate this by providing the same learning model with data from 74 distinct formal languages which have been argued to capture key features of language, have been studied in experimental work, or come from an interesting complexity class. The model is able to successfully induce the latent system generating the observed strings from small amounts of evidence in almost all cases, including for regular (e.g., an, (ab)n, and {a,b}+, context-free (e.g., anbn, anbn+m, and xxR), and context-sensitive (e.g., anbncn, anbmcndm, and xx) languages, as well as for many languages studied in learning experiments. These results show that relatively small amounts of positive evidence can support learning of rich classes of generative computations over structures. The model provides an idealized learning setup upon which additional cognitive constraints and biases can be formalized. [ABSTRACT FROM AUTHOR]

A dominant mechanism in the Judgment and Decision Making literature states that information is accumulated about each choice option until a decision threshold is met. Only after that threshold does a subject start to execute a motor response to indicate their choice. However, recent research has revealed spatial gradients in motor responses as a function of comparison difficulty as well as changes-of-mind in the middle of an action, both suggesting continued accumulation and processing of decision-related signals after the decision boundary. Here we present a formal model and supporting data from a number comparison task that a continuous motor planner, combined with a simple statistical inference scheme, can model detailed behavioral effects without assuming a threshold. This threshold-free model reproduces subjects’ sensitivity to numerical distance in reaching, accuracy, reaction time, and changes of mind. We argue that the motor system positions the effectors using an optimal biomechanical feedback controller, and continuous statistical inference on outputs from cognitive processes. [ABSTRACT FROM AUTHOR]

The Pirahã language has been at the center of recent debates in linguistics, in large part because it is claimed not to exhibit recursion, a purported universal of human language. Here, we present an analysis of a novel corpus of natural Pirahã speech that was originally collected by Dan Everett and Steve Sheldon. We make the corpus freely available for further research. In the corpus, Pirahã sentences have been shallowly parsed and given morpheme-aligned English translations. We use the corpus to investigate the formal complexity of Pirahã syntax by searching for evidence of syntactic embedding. In particular, we search for sentences which could be analyzed as containing center-embedding, sentential complements, adverbials, complementizers, embedded possessors, conjunction or disjunction. We do not find unambiguous evidence for recursive embedding of sentences or noun phrases in the corpus. We find that the corpus is plausibly consistent with an analysis of Pirahã as a regular language, although this is not the only plausible analysis. [ABSTRACT FROM AUTHOR]