Allocentric Navigation Is Computationally Universal

A new theoretical paper by philosopher Gualtiero Piccinini, titled 'Allocentric Navigation Is Computationally Universal,' presents a novel bridge between neuroscience and computer science. The work offers three distinct mathematical proofs demonstrating that an idealized cognitive architecture based on allocentric navigation—the kind of 'mental map' system animals use to navigate their environment—is computationally universal. This means it possesses the same fundamental computing power as a Turing machine, the theoretical foundation of all modern computers. The proofs cleverly encode classic computational models into the language of spatial navigation.

The first proof constructs a universal two-counter machine by representing counters as the positions of two movable markers on orthogonal axes within a map. The second proof directly simulates a one-tape Turing machine by embedding a writable 'tape-path' into the landscape of the cognitive map. A third proof strengthens the model's biological plausibility by replacing a globally designated path with a two-dimensional field of landmarks carrying only local connection information. While the universality result itself is mathematically aligned with classical models like Kolmogorov-Uspensky machines, the paper's contribution is its self-contained reconstruction within the specific representational primitives of spatial cognition research.

This theoretical exercise is significant because it reframes abstract computability concepts using the core components studied by neuroscientists and psychologists researching navigation. It suggests that the neural machinery animals use to create and traverse mental maps is not just for getting from point A to point B; it is, in principle, a substrate powerful enough to support general-purpose computation. This provides a fresh, concrete framework for connecting high-level cognitive theories with the foundational theory of computation.