Computational universes
From MaRDI portal
Publication:2483574
DOI10.1016/j.chaos.2004.11.055zbMath1071.00501arXivphysics/0305048OpenAlexW3038091329WikidataQ58620646 ScholiaQ58620646MaRDI QIDQ2483574
Publication date: 25 July 2005
Published in: Chaos, Solitons and Fractals (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/physics/0305048
Related Items (13)
The construction of a class of trivariate nonseparable compactly supported orthogonal wavelets ⋮ A study of biorthogonal multiple vector-valued wavelets ⋮ Construction and characterizations of orthogonal vector-valued multivariate wavelet packets ⋮ Design and characterizations of a class of orthogonal multiple vector-valued wavelets with 4-scale ⋮ The research of a class of biorthogonal compactly supported vector-valued wavelets ⋮ The characterization of a class of subspace pseudoframes with arbitrary real number translations ⋮ Construction and properties of orthogonal matrix-valued wavelets and wavelet packets ⋮ Minimum-energy frames associated with refinable function of arbitrary integer dilation factor ⋮ Biological function and the genetic code are interdependent ⋮ Gödel incompleteness and the Black hole information paradox ⋮ Design of compactly supported trivariate orthogonal wavelets ⋮ From Heisenberg to Gödel via Chaitin ⋮ Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics
Cites Work
- On distance-preserving transformations of lines in Euclidean three-space
- Computational complementarity
- Invertible cellular automata: A review
- Conservative logic
- Philosophical problems of space and time. 2nd, enlarged ed
- Mappings of spaces with families of cones and space-time transformations
- Physical versus computational complementarity. I
- Can quantum mechanics be reconciled with cellular automata?
- A review of \(E\) infinity theory and the mass spectrum of high energy particle physics
- Determining the number of Higgs particles starting from general relativity and various other field theories
- One complexity theorist's view of quantum computing
- Automaton logic
- Logical equivalence between generalized urn models and finite automata
- The structure of space-time transformations
- Digital mechanics. An information process based on reversible universal cellular automata
- The unreasonable effectiveness of mathematics in the natural sciences. Richard courant lecture in mathematical sciences delivered at New York University, May 11, 1959
- The Pasting Constructions for Orthomodular Posets
- Unpredictability and undecidability in dynamical systems
- Undecidability principle and the uncertainty principle even for classical systems
- Finite Precision Measurement Nullifies the Kochen-Specker Theorem
- Predicting the future in relativistic spacetimes
- On Non-Computable Functions
- Quantum complexity theory
- A single quantum cannot be cloned
- A Contribution to Chronogeometry
- Logical Reversibility of Computation
- On the Gauge Invariance of the Neutral Vector Meson Theory
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Computational universes