scientific article; zbMATH DE number 521942
From MaRDI portal
Publication:4284061
zbMath0791.68084MaRDI QIDQ4284061
Publication date: 1 March 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Measures of information, entropy (94A17) Physics (00A79)
Related Items
Constructibility of the universal wave function, Product of partition logics, orthoalgebras, and automata, Complessità e dinamica della scoperta scientifica, Is complexity a source of incompleteness?, Faithful orthogonal representations of graphs from partition logics, Automaton partition logic versus quantum logic, Automaton logic, Physical versus computational complementarity. I, Deterministic automata. Simulation, universality and minimality, Quantum logic is undecidable, Randomness? What randomness?, Banach-Tarski theorem and Cantorian micro space-time, Realism and Texture: Benchmark Problems for Natural Computation, On the consistency of the quantum-like representation algorithm for hyperbolic interference, Analogues of quantum complementarity in the theory of automata, Time paradoxes reviewed, Entropy and quantum Kolmogorov complexity: a quantum Brudno's theorem, Epistemic horizons and the foundations of quantum mechanics, Empirical logic of finite automata: Microstatements versus macrostatements, Can quantum information be processed by macroscopic systems?, Computational universes, A combinatorial approach to nonlocality and contextuality, Non-Euclidean spacetime structure and the two-slit experiment, From experimental quantum optics to quantum gravity via a fuzzy Kähler manifold, The origin of universality: making and invalidating a free category, On consistency of the quantum-like representation algorithm, Interface of global and local semantics in a self-navigating system based on the concept lattice, Logical equivalence between generalized urn models and finite automata, Computational complementarity and shift spaces, Uncomputability and undecidability in economic theory, Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics, Finite nondeterministic automata: simulation and minimality, ``Linear chaos via paradoxical set decompositions.
