Universal Computation Is 'Almost Surely' Chaotic

Fixed point iterations are known to generate chaos, for some values in their parameter range. It is an established fact that Turing Machines are fixed point iterations. However, as these Machines operate in integer space, the standard notions of a chaotic system is not readily applicable for them. C...

Full description

Saved in:
Bibliographic Details
Main Authors Mondal, Nabarun, Ghosh, Partha P
Format Journal Article
LanguageEnglish
Published 21.11.2011
Subjects
Computer Science - Computational Complexity
Mathematics - Dynamical Systems
Mathematics - Number Theory
Physics - Chaotic Dynamics
Online AccessGet full text

Cover

More Information
Summary:Fixed point iterations are known to generate chaos, for some values in their parameter range. It is an established fact that Turing Machines are fixed point iterations. However, as these Machines operate in integer space, the standard notions of a chaotic system is not readily applicable for them. Changing the state space of Turing Machines from integer to rational space, the condition for chaotic dynamics can be suitably established, as presented in the current paper. Further it is deduced that, given random input, computation performed by a Universal Turing Machine would be 'almost surely' chaotic.
DOI:10.48550/arxiv.1111.4949