Logical Quantum Field Theory

09/09/2019
by   Christof Schmidhuber, et al.
0

We consider the statistical mechanical ensemble of bit string histories that are computed by a universal Turing machine. The role of the energy is played by the program size. We show that this ensemble has a first-order phase transition at a critical temperature, at which the partition function equals Chaitin's halting probability Ω. This phase transition is almost zeroth-order in the sense that the free energy is continuous near the critical temperature, but almost jumps: it converges more slowly to its finite critical value than any computable function. We define a non-universal Turing machine that approximates this behavior of the partition function in a computable way by a super-logarithmic singularity, and study its statistical mechanical properties. For universal Turing machines, we conjecture that the ensemble of bit string histories at the critical temperature can be formulated as a string theory.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/05/2013

An Effective Procedure for Computing "Uncomputable" Functions

We give an effective procedure that produces a natural number in its out...
research
01/03/2020

A Probability Density Theory for Spin-Glass Systems

Spin-glass systems are universal models for representing many-body pheno...
research
12/26/2017

First Draft on the xInf Model for Universal Physical Computation and Reverse Engineering of Natural Intelligence

Turing Machines are universal computing machines in theory. It has been ...
research
06/30/2023

A Framework for Universality in Physics, Computer Science, and Beyond

Turing machines and spin models share a notion of universality according...
research
12/27/2019

The Epistemic Landscape: a Computability Perspective

By nature, transmissible human knowledge is enumerable: every sentence, ...
research
12/03/2021

A reliable Turing machine

We consider computations of a Turing machine subjected to noise. In ever...
research
04/08/2019

Learning the undecidable from networked systems

This article presents a theoretical investigation of computation beyond ...

Please sign up or login with your details

Forgot password? Click here to reset