Self-referential basis of undecidable dynamics: from The Liar Paradox and The Halting Problem to The Edge of Chaos

11/07/2017
by   Mikhail Prokopenko, et al.
0

In this paper we explore several fundamental relations between formal systems, algorithms, and dynamical systems, focussing on the roles of undecidability, universality, diagonalization, and self-reference in each of these computational frameworks. Some of these interconnections are well-known, while some are clarified in this study as a result of a fine-grained comparison between recursive formal systems, Turing machines, and Cellular Automata (CAs). In particular, we elaborate on the diagonalization argument applied to distributed computation carried out by CAs, illustrating the key elements of Gödel's proof for CAs. The comparative analysis emphasizes three factors which underlie the capacity to generate undecidable dynamics within the examined computational frameworks: (i) the program-data duality; (ii) the potential to access an infinite computational medium; and (iii) the ability to implement negation. The considered adaptations of Gödel's proof distinguish between computational universality and undecidability, and show how the diagonalization argument exploits, on several levels, the self-referential basis of undecidability.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/06/2019

Universal One-Dimensional Cellular Automata Derived for Turing Machines and its Dynamical Behaviour

Universality in cellular automata theory is a central problem studied an...
research
08/03/2021

Classification of Discrete Dynamical Systems Based on Transients

In order to develop systems capable of artificial evolution, we need to ...
research
07/27/2017

Providing Self-Aware Systems with Reflexivity

We propose a new type of self-aware systems inspired by ideas from highe...
research
05/28/2020

No Substitute for Functionalism – A Reply to 'Falsification Consciousness'

In their paper 'Falsification and Consciousness' [1], Kleiner and Hoel i...
research
05/02/2021

Fixed Point Constructions in Tilings and Cellular Automata

The fixed point construction is a method for designing tile sets and cel...
research
06/23/2018

An Inductive Formalization of Self Reproduction in Dynamical Hierarchies

Formalizing self reproduction in dynamical hierarchies is one of the imp...
research
03/26/2007

Competition of Self-Organized Rotating Spiral Autowaves in a Nonequilibrium Dissipative System of Three-Level Phaser

We present results of cellular automata based investigations of rotating...

Please sign up or login with your details

Forgot password? Click here to reset