Abstract
To every generalized urn model there exists a finite (Mealy) automaton with identical propositional calculus. The converse is true as well.
Similar content being viewed by others
References
Calude, C., Calude, E., Svozil, K., and Yu, S. (1997). Physical versus computational complementarity I. International Journal of Theoretical Physics 36(7), 1495–1523.
Dvurečenskij, A., Pulmannová, S., and Svozil, K. (1995). Partition logics, orthoalgebras and automata. Helvetica Physica Acta 68, 407–428.
Kochen, S. and Specker, E. P. (1967). The problem of hidden variables in quantum mechanics. Journal of Mathematics and Mechanics 17(1), 59–87. Reprinted in (Specker, 1990, pp. 235–263).
Schaller, M. and Svozil, K. (1996). Automaton logic. International Journal of Theoretical Physics 35(5), 911–940.
Specker, E. (1990). Selecta. Birkhäuser Verlag, Basel.
Specker, E. (1999). (Private communication).
Svozil, K. (1993). Randomness & Undecidability in Physics, World Scientific, Singapore.
Svozil, K. (1998). Quantum Logic, Singapore, Springer.
Wright, R. (1978). The state of the pentagon. A nonclassical example. In Mathematical Foundations of Quantum Theory, A. R. Marlow, ed., Academic Press, New York, pp. 255–274.
Wright, R. (1990). Generalized urn models. Foundations of Physics 20, 881–903.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Svozil, K. Logical Equivalence Between Generalized Urn Models and Finite Automata. Int J Theor Phys 44, 745–754 (2005). https://doi.org/10.1007/s10773-005-7052-0
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s10773-005-7052-0