Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

WORLD SCIENTIFIC eBooks

ANALYSIS OF INFORMATION AND COMPUTATION IN PHYSICS EXPLAINS COGNITIVE PARADIGMS: FROM FULL COGNITION TO LAPLACE DETERMINISM TO STATISTICAL DETERMINISM TO MODERN APPROACH

Владик Крейнович, Roberto Araiza, Juan Ferret

Published Jun 1, 2011• 1 citation
Publisher

Abstract

In this paper, we analyze the problem of prediction in physics from the computational viewpoint. We show that physical paradigms like Laplace determinism, statistical determinism, etc., can be naturally explained by this computational analysis. In our explanations, we use the notions of the Algorithmic Information Theory such as Kolmogorov complexity and algorithmic randomness, as well as the novel, more physics-oriented variants of these notions.

DOI
10.1142/9789814295482_0008

Related papers

Randomness in the Universe: An Incompressible Manifestation of Deep Deterministic Structures

Jincheng Zhang

This study investigates the fundamental nature of randomness in physics. Long dominated by the Copenhagen interpretation of quantum mechanics, the mainstream physical paradigm treats quantum randomness as an intrinsic and irreducible feature of nature. This paper proposes an alternative theoretical framework, arguing that observed cosmic randomness is not a foundational physical property, but rather an incompressible manifestation of deeper deterministic physical laws, hidden relational structures, and state evolutions in high-dimensional phase spaces. By integrating the concept of Kolmogorov complexity from algorithmic information theory with hidden relational topology models, we demonstrate that when a deterministic system's internal connectivity becomes too complex for algorithmic compression within low-dimensional observational constraints, its behavior becomes statistically indistinguishable from genuine stochasticity. This paper re-evaluates the interplay among quantum probability, information bounds, and deterministic dynamics, outlining a possible path toward unifying quantum mechanics and general relativity under a foundational deterministic architecture.

•Jul 24, 2026•0 citations

QUANTUM FIELD THEORY AND COMPUTATIONAL PARADIGMS

E. V. Krishnamurthy, Vikram Krishnamurthy

We introduce the basic theory of quantization of radiation field in quantum physics and explain how it relates to the theory of recursive functions in computer science. We outline the basic differences between quantum mechanics (QM) and quantum field theory (QFT) and explain why QFT is better suited for a computational paradigm — based on algorithmic requirement, countably infinite degrees of freedom and the creation of macroscopic output objects. The quanta of the radiation field correspond to the non-negative integers and the harmonic oscillator spectra correspond to the recursive computation — with the creation and annihilation operators, respectively, playing the same role as the successor and predecessor in computability theory. Accordingly, this approach relates the classical computational model and the quantum physical model more directly than the Turing machine approach used earlier. Also, the application of Lambda calculus formalism and the associated denotational semantics (that is widely used in the classical computational paradigm involving recursive functions) for applications to computational paradigm based on quantum field theory is described. Finally, we explain where QFT and conventional paradigm depart from each other, and examine the concept of fixed points, phase transitions, programmability, emergent computation and related open problems.

International Journal of Modern Physics C•Oct 1, 2001•4 citations

Expanding Algorithmic Randomness to the Algebraic Approach to Quantum Physics: Kolmogorov Complexity and Quantum Logics

Владик Крейнович

Physicists usually assume that events with a very small probability cannot occur. Kolmogorov complexity formalizes this idea for non-quantum events. We show how this formalization can be extended to quantum events as well.

Journal of Uncertain Systems•Jan 1, 2010•0 citations

Introduction: Where Statistical Physics Meets Computation

Allon G. Percus, Gabriel Istrate

Computer science and physics have been closely linked since the birth of modern computing. This book is about that link. John von Neumann’s original design for digital computing in the 1940s was motivated by applications in ballistics and hydrodynamics, and his model still underlies today’s hardware architectures. Within several years of the invention of the first digital computers, the Monte Carlo method was developed, putting these devices to work simulating natural processes using the principles of statistical physics. It is difficult to imagine how computing might have evolved without the physical insights that nurtured it. It is impossible to imagine how physics would have evolved without computation. While digital computers quickly became indispensable, a true theoretical understanding of the efficiency of the computation process did not occur until twenty years later. In 1965, Hartmanis and Stearns [227] as well as Edmonds [139, 140] articulated the notion of computational complexity, categorizing algorithms according to how rapidly their time and space requirements grow with input size. The qualitative distinctions that computational complexity draws between algorithms form the foundation of theoretical computer science. Chief among these distinctions is that of polynomial versus exponential time. A combinatorial problem belongs in the complexity class P (polynomial time) if there exists an algorithm guaranteeing a solution in a computation time, or number of elementary steps of the algorithm, that grows at most polynomially with input size. Loosely speaking, such problems are considered computationally feasible. An example might be sorting a list of n numbers: even a particularly naive and inefficient algorithm for this will run in a number of steps that grows as O(n2), and so sorting is in the class P. A problem belongs in the complexity class NP (non-deterministic polynomial time) if it is merely possible to test, in polynomial time, whether a specific presumed solution is correct. Of course, P ⊆ NP: for any problem whose solution can be found in polynomial time, one can surely verify the validity of a presumed solution in polynomial time.

Oxford University Press eBooks•Dec 15, 2005•0 citations

QUANTUM ANNEALING: FROM VIEWPOINTS OF STATISTICAL PHYSICS, CONDENSED MATTER PHYSICS, AND COMPUTATIONAL PHYSICS

Shu Tanaka, Ryo Tamura

In this paper, we review some features of quantum annealing and related topics from viewpoints of statistical physics, condensed matter physics, and computational physics. We can obtain a better solution of optimization problems in many cases by using the quantum annealing. Actually the efficiency of the quantum annealing has been demonstrated for problems based on statistical physics. Then the quantum annealing has been expected to be an efficient and generic solver of optimization problems. Since many implementation methods of the quantum annealing have been developed and will be proposed in the future, theoretical frameworks of wide area of science and experimental technologies will be evolved through studies of the quantum annealing.

arXiv:1204.2907•Kinki Universtiy series on quantum computing•Oct 4, 2012•3 citations

Aspects Of Computability In Physics

Joseph Shipman

This paper reviews connections between physics and computation, and explores their implications. The main topics are computational "hardness" of physical systems, computational status of fundamental theories, quantum computation, and the Universe as a computer.

arXiv:math/9711204•Workshop on Physics and Computation (PhysComp)•Aug 24, 2005•4 citations
In this paper, we analyze the problem of prediction in physics from the computational viewpoint. We show that physical paradigms like Laplace determinism, statistical determinism, etc., can be naturally explained by this computational analysis. In our explanations, we use the notions of the Algorithmic Information Theory such as Kolmogorov complexity and algorithmic randomness, as well as the novel, more physics-oriented variants of these notions.
This study investigates the fundamental nature of randomness in physics. Long dominated by the Copenhagen interpretation of quantum mechanics, the mainstream physical paradigm treats quantum randomness as an intrinsic and irreducible feature of nature. This paper proposes an alternative theoretical framework, arguing that observed cosmic randomness is not a foundational physical property, but rather an incompressible manifestation of deeper deterministic physical laws, hidden relational structures, and state evolutions in high-dimensional phase spaces. By integrating the concept of Kolmogorov complexity from algorithmic information theory with hidden relational topology models, we demonstrate that when a deterministic system's internal connectivity becomes too complex for algorithmic compression within low-dimensional observational constraints, its behavior becomes statistically indistinguishable from genuine stochasticity. This paper re-evaluates the interplay among quantum probability, information bounds, and deterministic dynamics, outlining a possible path toward unifying quantum mechanics and general relativity under a foundational deterministic architecture.
We introduce the basic theory of quantization of radiation field in quantum physics and explain how it relates to the theory of recursive functions in computer science. We outline the basic differences between quantum mechanics (QM) and quantum field theory (QFT) and explain why QFT is better suited for a computational paradigm — based on algorithmic requirement, countably infinite degrees of freedom and the creation of macroscopic output objects. The quanta of the radiation field correspond to the non-negative integers and the harmonic oscillator spectra correspond to the recursive computation — with the creation and annihilation operators, respectively, playing the same role as the successor and predecessor in computability theory. Accordingly, this approach relates the classical computational model and the quantum physical model more directly than the Turing machine approach used earlier. Also, the application of Lambda calculus formalism and the associated denotational semantics (that is widely used in the classical computational paradigm involving recursive functions) for applications to computational paradigm based on quantum field theory is described. Finally, we explain where QFT and conventional paradigm depart from each other, and examine the concept of fixed points, phase transitions, programmability, emergent computation and related open problems.
Computer science and physics have been closely linked since the birth of modern computing. This book is about that link. John von Neumann’s original design for digital computing in the 1940s was motivated by applications in ballistics and hydrodynamics, and his model still underlies today’s hardware architectures. Within several years of the invention of the first digital computers, the Monte Carlo method was developed, putting these devices to work simulating natural processes using the principles of statistical physics. It is difficult to imagine how computing might have evolved without the physical insights that nurtured it. It is impossible to imagine how physics would have evolved without computation. While digital computers quickly became indispensable, a true theoretical understanding of the efficiency of the computation process did not occur until twenty years later. In 1965, Hartmanis and Stearns [227] as well as Edmonds [139, 140] articulated the notion of computational complexity, categorizing algorithms according to how rapidly their time and space requirements grow with input size. The qualitative distinctions that computational complexity draws between algorithms form the foundation of theoretical computer science. Chief among these distinctions is that of polynomial versus exponential time. A combinatorial problem belongs in the complexity class P (polynomial time) if there exists an algorithm guaranteeing a solution in a computation time, or number of elementary steps of the algorithm, that grows at most polynomially with input size. Loosely speaking, such problems are considered computationally feasible. An example might be sorting a list of n numbers: even a particularly naive and inefficient algorithm for this will run in a number of steps that grows as O(n2), and so sorting is in the class P. A problem belongs in the complexity class NP (non-deterministic polynomial time) if it is merely possible to test, in polynomial time, whether a specific presumed solution is correct. Of course, P ⊆ NP: for any problem whose solution can be found in polynomial time, one can surely verify the validity of a presumed solution in polynomial time.
In this paper, we review some features of quantum annealing and related topics from viewpoints of statistical physics, condensed matter physics, and computational physics. We can obtain a better solution of optimization problems in many cases by using the quantum annealing. Actually the efficiency of the quantum annealing has been demonstrated for problems based on statistical physics. Then the quantum annealing has been expected to be an efficient and generic solver of optimization problems. Since many implementation methods of the quantum annealing have been developed and will be proposed in the future, theoretical frameworks of wide area of science and experimental technologies will be evolved through studies of the quantum annealing.