scientific article; zbMATH DE number 521942
From MaRDI portal
Publication:4284061
Physics (00A79) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Measures of information, entropy (94A17)
Recommendations
Cited in
(48)- Uncomputability and undecidability in economic theory
- Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics
- Banach-Tarski theorem and Cantorian micro space-time
- Physical versus computational complementarity. I
- Deterministic automata. Simulation, universality and minimality
- Finite nondeterministic automata: simulation and minimality
- Epistemic horizons and the foundations of quantum mechanics
- Automaton partition logic versus quantum logic
- Automaton logic
- Time paradoxes reviewed
- Faithful orthogonal representations of graphs from partition logics
- Randomness? What randomness?
- A combinatorial approach to nonlocality and contextuality
- On consistency of the quantum-like representation algorithm
- Constructibility of the universal wave function
- Product of partition logics, orthoalgebras, and automata
- Is complexity a source of incompleteness?
- Entropy and quantum Kolmogorov complexity: a quantum Brudno's theorem
- Can quantum information be processed by macroscopic systems?
- Computational universes
- Non-Euclidean spacetime structure and the two-slit experiment
- From experimental quantum optics to quantum gravity via a fuzzy Kähler manifold
- Logical equivalence between generalized urn models and finite automata
- Quantum logic is undecidable
- A constructivist manifesto for the physical sciences -- constructive re-interpretation of physical undecidability
- Physical unknowables
- Incomputability in physics and biology
- Realism and Texture: Benchmark Problems for Natural Computation
- scientific article; zbMATH DE number 6019529 (Why is no real title available?)
- PHYSICS OF RANDOMNESS AND REGULARITIES FOR CITIES, LANGUAGES, AND THEIR LIFETIMES AND FAMILY TREES
- Incomputability in physics
- scientific article; zbMATH DE number 50833 (Why is no real title available?)
- On the consistency of the quantum-like representation algorithm for hyperbolic interference
- Undecidability principle and the uncertainty principle even for classical systems
- Complessità e dinamica della scoperta scientifica
- Undecidability, uncomputability, and unpredictability
- Computability and information in models of randomness and chaos
- scientific article; zbMATH DE number 2187721 (Why is no real title available?)
- From Heisenberg to Gödel via Chaitin
- The origin of universality: making and invalidating a free category
- Interface of global and local semantics in a self-navigating system based on the concept lattice
- Analogues of quantum complementarity in the theory of automata
- How real is incomputability in physics?
- Algorithmic economics: incomputability, undecidability and unsolvability in economics
- Empirical logic of finite automata: Microstatements versus macrostatements
- Random world and quantum mechanics
- ``Linear chaos via paradoxical set decompositions.
- Computational complementarity and shift spaces
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4284061)
