Computational universes
From MaRDI portal
Publication:2483574
Abstract: Suspicions that the world might be some sort of a machine or algorithm existing ``in the mind of some symbolic number cruncher have lingered from antiquity. Although popular at times, the most radical forms of this idea never reached mainstream. Modern developments in physics and computer science have lent support to the thesis, but empirical evidence is needed before it can begin to replace our contemporary world view.
Recommendations
- The computable universe hypothesis
- Cosmic computation
- The subjective computable universe
- The universe as quantum computer
- Computation, hypercomputation, and physical science
- The universe and the quantum computer
- Universal computation and physical dynamics
- A universe of binding and computation
- scientific article; zbMATH DE number 1909825
Cites work
- scientific article; zbMATH DE number 1818513 (Why is no real title available?)
- scientific article; zbMATH DE number 3119894 (Why is no real title available?)
- scientific article; zbMATH DE number 3856413 (Why is no real title available?)
- scientific article; zbMATH DE number 3950473 (Why is no real title available?)
- scientific article; zbMATH DE number 3987248 (Why is no real title available?)
- scientific article; zbMATH DE number 1189116 (Why is no real title available?)
- scientific article; zbMATH DE number 3668602 (Why is no real title available?)
- scientific article; zbMATH DE number 44959 (Why is no real title available?)
- scientific article; zbMATH DE number 45942 (Why is no real title available?)
- scientific article; zbMATH DE number 54162 (Why is no real title available?)
- scientific article; zbMATH DE number 194276 (Why is no real title available?)
- scientific article; zbMATH DE number 4123308 (Why is no real title available?)
- scientific article; zbMATH DE number 1219621 (Why is no real title available?)
- scientific article; zbMATH DE number 521942 (Why is no real title available?)
- scientific article; zbMATH DE number 1161569 (Why is no real title available?)
- scientific article; zbMATH DE number 1948489 (Why is no real title available?)
- scientific article; zbMATH DE number 1548484 (Why is no real title available?)
- scientific article; zbMATH DE number 1911266 (Why is no real title available?)
- scientific article; zbMATH DE number 2115042 (Why is no real title available?)
- scientific article; zbMATH DE number 1418480 (Why is no real title available?)
- scientific article; zbMATH DE number 3232036 (Why is no real title available?)
- scientific article; zbMATH DE number 3247164 (Why is no real title available?)
- scientific article; zbMATH DE number 3273135 (Why is no real title available?)
- scientific article; zbMATH DE number 3290249 (Why is no real title available?)
- scientific article; zbMATH DE number 3323530 (Why is no real title available?)
- scientific article; zbMATH DE number 3366846 (Why is no real title available?)
- scientific article; zbMATH DE number 3051296 (Why is no real title available?)
- scientific article; zbMATH DE number 3076934 (Why is no real title available?)
- A Contribution to Chronogeometry
- A review of \(E\) infinity theory and the mass spectrum of high energy particle physics
- A single quantum cannot be cloned
- Automaton logic
- Can quantum mechanics be reconciled with cellular automata?
- Computational complementarity
- Conservative logic
- Determining the number of Higgs particles starting from general relativity and various other field theories
- Digital mechanics. An information process based on reversible universal cellular automata
- Finite Precision Measurement Nullifies the Kochen-Specker Theorem
- Information, randomness and incompleteness. Papers on algorithmic information theory
- Invertible cellular automata: A review
- Logical Reversibility of Computation
- Logical equivalence between generalized urn models and finite automata
- Mappings of spaces with families of cones and space-time transformations
- On distance-preserving transformations of lines in Euclidean three-space
- On non-computable functions
- On the Gauge Invariance of the Neutral Vector Meson Theory
- One complexity theorist's view of quantum computing
- Philosophical problems of space and time. 2nd, enlarged ed
- Physical versus computational complementarity. I
- Predicting the future in relativistic spacetimes
- Quantum complexity theory
- The Pasting Constructions for Orthomodular Posets
- The structure of space-time transformations
- The unreasonable effectiveness of mathematics in the natural sciences. Richard courant lecture in mathematical sciences delivered at New York University, May 11, 1959
- Undecidability principle and the uncertainty principle even for classical systems
- Unpredictability and undecidability in dynamical systems
Cited in
(24)- The research of a class of biorthogonal compactly supported vector-valued wavelets
- Debugging the universe
- The subjective computable universe
- Biological function and the genetic code are interdependent
- Clockwork Rebooted: Is the Universe a Computer?
- Gödel incompleteness and the Black hole information paradox
- Construction and characterizations of orthogonal vector-valued multivariate wavelet packets
- scientific article; zbMATH DE number 1973150 (Why is no real title available?)
- Design and characterizations of a class of orthogonal multiple vector-valued wavelets with 4-scale
- The characterization of a class of subspace pseudoframes with arbitrary real number translations
- Minimum-energy frames associated with refinable function of arbitrary integer dilation factor
- From Heisenberg to Gödel via Chaitin
- Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics
- A study of biorthogonal multiple vector-valued wavelets
- Are There Traces of Megacomputing in Our Universe
- Estimates of universal computational capacity to the present
- scientific article; zbMATH DE number 1759502 (Why is no real title available?)
- scientific article; zbMATH DE number 1901188 (Why is no real title available?)
- A Computational Approach to an Alternative Working Environment for the Constructible Universe
- Design of compactly supported trivariate orthogonal wavelets
- Construction and properties of orthogonal matrix-valued wavelets and wavelet packets
- The fastest way of computing all universes
- Universe creation on a computer
- The construction of a class of trivariate nonseparable compactly supported orthogonal wavelets
This page was built for publication: Computational universes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2483574)
