The Machine as Data: A Computational View of Emergence and Definability

06/20/2015
by   S. Barry Cooper, et al.
0

Turing's (1936) paper on computable numbers has played its role in underpinning different perspectives on the world of information. On the one hand, it encourages a digital ontology, with a perceived flatness of computational structure comprehensively hosting causality at the physical level and beyond. On the other (the main point of Turing's paper), it can give an insight into the way in which higher order information arises and leads to loss of computational control - while demonstrating how the control can be re-established, in special circumstances, via suitable type reductions. We examine the classical computational framework more closely than is usual, drawing out lessons for the wider application of information-theoretical approaches to characterizing the real world. The problem which arises across a range of contexts is the characterizing of the balance of power between the complexity of informational structure (with emergence, chaos, randomness and 'big data' prominently on the scene) and the means available (simulation, codes, statistical sampling, human intuition, semantic constructs) to bring this information back into the computational fold. We proceed via appropriate mathematical modelling to a more coherent view of the computational structure of information, relevant to a wide spectrum of areas of investigation.

READ FULL TEXT

page 1

page 8

page 15

page 20

page 25

page 26

page 28

page 30

research
09/03/2021

Betwixt Turing and Kleene

Turing's famous 'machine' model constitutes the first intuitively convin...
research
06/13/2022

A Relative Church-Turing-Deutsch Thesis from Special Relativity and Undecidability

Beginning with Turing's seminal work in 1950, artificial intelligence pr...
research
03/11/2019

The relationship between word complexity and computational complexity in subshifts

We prove several results about the relationship between the word complex...
research
01/27/2023

Turing Machines Equipped with CTC in Physical Universes

We study the paradoxical aspects of closed time-like curves and their im...
research
07/28/2023

Oracle Computability and Turing Reducibility in the Calculus of Inductive Constructions

We develop synthetic notions of oracle computability and Turing reducibi...
research
11/06/2017

Coding-theorem Like Behaviour and Emergence of the Universal Distribution from Resource-bounded Algorithmic Probability

Previously referred to as 'miraculous' because of its surprisingly power...
research
08/10/2019

Classical Information Theory of Networks

Heterogeneity is among the most important features characterizing real-w...

Please sign up or login with your details

Forgot password? Click here to reset