scientific article; zbMATH DE number 521942
From MaRDI portal
Publication:4284061
zbMATH Open0791.68084MaRDI QIDQ4284061FDOQ4284061
Authors: Karl Svozil 
Publication date: 1 March 1994
Title of this publication is not available (Why is that?)
Recommendations
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Measures of information, entropy (94A17) Physics (00A79) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)
Cited In (47)
- Banach-Tarski theorem and Cantorian micro space-time
- Incomputability in physics and biology
- On the consistency of the quantum-like representation algorithm for hyperbolic interference
- Epistemic horizons and the foundations of quantum mechanics
- Logical equivalence between generalized urn models and finite automata
- 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
- Can quantum information be processed by macroscopic systems?
- Title not available (Why is that?)
- Uncomputability and undecidability in economic theory
- Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics
- Product of partition logics, orthoalgebras, and automata
- Algorithmic economics: incomputability, undecidability and unsolvability in economics
- Computational complementarity and shift spaces
- PHYSICS OF RANDOMNESS AND REGULARITIES FOR CITIES, LANGUAGES, AND THEIR LIFETIMES AND FAMILY TREES
- Constructibility of the universal wave function
- A constructivist manifesto for the physical sciences -- constructive re-interpretation of physical undecidability
- Realism and Texture: Benchmark Problems for Natural Computation
- Physical versus computational complementarity. I
- From Heisenberg to Gödel via Chaitin
- Title not available (Why is that?)
- Finite nondeterministic automata: simulation and minimality
- Time paradoxes reviewed
- Deterministic automata. Simulation, universality and minimality
- On consistency of the quantum-like representation algorithm
- Quantum logic is undecidable
- Undecidability principle and the uncertainty principle even for classical systems
- A combinatorial approach to nonlocality and contextuality
- Analogues of quantum complementarity in the theory of automata
- Entropy and quantum Kolmogorov complexity: a quantum Brudno's theorem
- Faithful orthogonal representations of graphs from partition logics
- Is complexity a source of incompleteness?
- Computational universes
- Non-Euclidean spacetime structure and the two-slit experiment
- Physical unknowables
- Randomness? What randomness?
- Title not available (Why is that?)
- From experimental quantum optics to quantum gravity via a fuzzy Kähler manifold
- Complessità e dinamica della scoperta scientifica
- How real is incomputability in physics?
- Automaton partition logic versus quantum logic
- Automaton logic
- Computability and information in models of randomness and chaos
- Incomputability in physics
- ``Linear chaos via paradoxical set decompositions.
- Empirical logic of finite automata: Microstatements versus macrostatements
- Undecidability, uncomputability, and unpredictability
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)
