Logical equivalence between generalized urn models and finite automata
arXiv:quant-ph/0209136 · doi:10.1007/s10773-005-7052-0
Abstract
To every generalized urn model there exists a finite (Mealy) automaton with identical propositional calculus. The converse is true as well.
9 pages, minor changes
Cited by in corpus (20)
- Strong Kochen-Specker theorem and incomputability of quantum randomness
- Quantum randomness and value indefiniteness
- Minimal true-implies-false and true-implies-true sets of propositions in noncontextual hidden variable theories
- Staging quantum cryptography with chocolate balls
- Quantum Scholasticism: On Quantum Contexts, Counterfactuals, and the Absurdities of Quantum Omniscience
- Epistemic Entanglement due to Non-Generating Partitions of Classical Dynamical Systems
- What makes quantum clicks special?
- Extensions of Hardy-type true-implies-false gadgets to classically obtain indistinguishability
- New forms of quantum value indefiniteness suggest that incompatible views on contexts are epistemic
- Faithful orthogonal representations of graphs from partition logics
- A Non-Probabilistic Model of Relativised Predictability in Physics
- Roots and (re)sources of value (in)definiteness versus contextuality. A contribution to the Pitowsky Volume in memory of Itamar Pitowsky (1950--2010)
- Generalized Greenberger-Horne-Zeilinger arguments from quantum logical analysis
- Classical predictions for intertwined quantum observables are contingent and thus inconclusive
- Extending Kolmogorov's axioms for a generalized probability theory on collections of contexts
- Varieties of contextuality based on probability and structural nonembeddability
- Quantum violation of the Suppes-Zanotti inequalities and "contextuality"
- Orthogonal vector computations
- Form of Contextuality Predicting Probabilistic Equivalence between Two Sets of Three Mutually Noncommuting Observables
- Exploring Quantum Contextuality with the Quantum Moebius-Escher-Penrose hypergraph