Syntactic Recursion Facilitates and Working Memory Predicts Recursive Theory of Mind

2017-01-10
Arslan, Burcu
Verbrugge, Rineke
Show full item record
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
105
views
83
downloads
In this study, we focus on the possible roles of second-order syntactic recursion and working memory in terms of simple and complex span tasks in the development of second-order false belief reasoning. We tested 89 Turkish children in two age groups, one younger (4;6-6;5 years) and one older (6;7-8;10 years). Although second-order syntactic recursion is significantly correlated with the second-order false belief task, results of ordinal logistic regressions revealed that the main predictor of second-order false belief reasoning is complex working memory span. Unlike simple working memory and second-order syntactic recursion tasks, the complex working memory task required processing information serially with additional reasoning demands that require complex working memory strategies. Based on our results, we propose that children's second-order theory of mind develops when they have efficient reasoning rules to process embedded beliefs serially, thus overcoming a possible serial processing bottleneck.
Individual-differences, Executive function, Inhibitory contegrated theory, Dnttask, Children, ual-rol, Ilanguage, Preschoolers, Acquisition, Representation
https://hdl.handle.net/11511/30277
Graduate School of Social Sciences, Article

Suggestions

Recursive Compositional Reinforcement Learning for Continuous Control Sürekli Kontrol Uygulamalari için Özyinelemeli Bileşimsel Pekiştirmeli Öǧrenme
Tanik, Guven Orkun; Ertekin Bolelli, Şeyda (2022-01-01)
© 2022 IEEE.Compositional and temporal abstraction is the key to improving learning and planning in reinforcement learning. Modern real-world control problems call for continuous control domains and robust, sample efficient and explainable control frameworks. We are presenting a framework for recursively composing control skills to solve compositional and progressively complex tasks. The framework promotes reuse of skills, and as a result quickly adaptable to new tasks. The decision-tree can be observed, pr...
Improving reinforcement learning using distinctive clues of the environment
Demir, Alper; Polat, Faruk; Department of Computer Engineering (2019)
Effective decomposition and abstraction has been shown to improve the performance of Reinforcement Learning. An agent can use the clues from the environment to either partition the problem into sub-problems or get informed about its progress in a given task. In a fully observable environment such clues may come from subgoals while in a partially observable environment they may be provided by unique experiences. The contribution of this thesis is two fold; first improvements over automatic subgoal identifica...
Temporal logic model predictive control for discrete time systems
Aydın Göl, Ebru (2013-04-08)
This paper proposes an optimal control strategy for a discrete-time linear system constrained to satisfy a temporal logic specification over a set of linear predicates in its state variables. The cost is a quadratic function that penalizes the distance from desired state and control trajectories. The specification is a formula of syntactically co-safe Linear Temporal Logic (scLTL), which can be satisfied in finite time. It is assumed that the reference trajectories are only available over a finite horizon a...
Optimising a nonlinear utility function in multi-objective integer programming
Ozlen, Melih; Azizoğlu, Meral; Burton, Benjamin A. (2013-05-01)
In this paper we develop an algorithm to optimise a nonlinear utility function of multiple objectives over the integer efficient set. Our approach is based on identifying and updating bounds on the individual objectives as well as the optimal utility value. This is done using already known solutions, linear programming relaxations, utility function inversion, and integer programming. We develop a general optimisation algorithm for use with k objectives, and we illustrate our approach using a tri-objective i...
Transformation Electromagnetics Based Analysis of Waveguides With Random Rough or Periodic Grooved Surfaces
Ozgun, Ozlem; Kuzuoğlu, Mustafa (Institute of Electrical and Electronics Engineers (IEEE), 2013-02-01)
A computational model is introduced which employs transformation-based media to increase the computational performance of finite methods (such as finite element or finite difference methods) for analyzing waveguides with grooves or rough surfaces. Random behavior of the roughness is taken into account by utilizing the Monte Carlo technique, which is based on a set of random rough surfaces generated from Gaussian distribution. The main objective of the proposed approach is to create a single mesh, and to ana...
Citation Formats
B. Arslan and R. Verbrugge, “Syntactic Recursion Facilitates and Working Memory Predicts Recursive Theory of Mind,” PLOS ONE, pp. 0–0, 2017, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/30277.
METU IIS - Integrated Information Service open@metu.edu.tr