We present an intuitive explanation for the limited effectiveness of front-to-end bidirectional heuristic search, supported with extensive evidence from many commonly-studied domains. While previous work has proved the limitations of specific algorithms, we show that any front-to-end bidirectional heuristic search algorithm will likely be dominated by unidirectional heuristic search or bidirect...

In this paper, we study the fundamental problem of counting, which consists in computing the size of a system. We consider the distributed communication model of population protocols of finite state, anonymous and asynchronous mobile devices (agents) communicating in pairs (according to a fairness condition). This work significantly improves the previous results known for counting in this model...

Research exploring cognitive theories of executive function (EF) report positive associations with academic outcomes, but whether such general cognitive theories generalise to when children are exposed to social or economic poverty contexts require more in-depth investigating. This study explores associations between EF and academic achievement for an ethnic minority sample aged 8–10 years, fro...

A fundamental problem of AI is that of how to simulate a particular kind of behaviour – that of intelligence. This paper describes an alternative approach to reproducing action systems by a geometric analysis of behaviour. If the behaviour to be reproduced has a particular character, a character identified by a self-affinity like that of fractal images, it may be possible to infer a program cap...

This article proposes an analysis of a dialogue between two children solving the Tower of Hanoï problem. To carry out such an analysis, we use the Interlocutory Logic which is a formal system constructed to express the logical and phenomenological properties of natural conversation.

In the Switching Tower of Hanoi interpretation of Sierpiński graphs Sn p , the P2 decision problem is to find out whether the largestmoving disc has to be transferred once or twice in a shortest path between two given states/vertices. We construct an essentially optimal algorithm thus extending Romik’s approach for p = 3 to the general case. The algorithm makes use of three automata and the und...

The article “Administrative Claims Data Versus Augmented Pregnancy Data for the Study of Pharmaceutical Treatments in Pregnancy,”written by Susan E. Andrade, Anick Bérard, Hedvig M.E.Nordeng,Mollie E.Wood,MarleenM.H.J. vanGelder, and Sengwee Toh, was originally published Online First without open access. After publication in volume 4, issue 2, and pages 106–116, the author decided to opt for Op...

This paper analyzes the causes for large differences in difficulty of various isomorphic versions of the Tower of Hanoi problem. Some forms of the problem take 16 times as long to solve, on average, as other versions. Since isomorphism rules out size of task domain as a determinant of relative difficulty, these experiments seek and find causes for the differences in features of the problem repr...