Logical equivalence between generalized urn models and finite automata

International Journal of Theoretical Physics

Volumn 44, Issue 7, 2005, Pages 745-754

  Svozil, Karl ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Automation logic; Computational complementarity; Generalized urn models

Indexed keywords

EID: 29144444681     PISSN: 00207748     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10773-005-7052-0     Document Type: Conference Paper

References (10)

1. Calude, C., Calude, E., Svozil, K., and Yu, S. (1997). Physical versus computational complementarity I. International Journal of Theoretical Physics 36(7), 1495-1523.
2. Dvurečenskij, A., Pulmannová, S., and Svozil, K. (1995). Partition logics, orthoalgebras and automata. Helvetica Physica Acta 68, 407-428.
3. 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).
4. Schaller, M. and Svozil, K. (1996). Automaton logic. International Journal of Theoretical Physics 35(5), 911-940.
5. Specker, E. (1990). Selecta. Birkhäuser Verlag, Basel.
6. Specker, E. (1999). (Private communication).
7. Svozil, K. (1993). Randomness & Undecidability in Physics, World Scientific, Singapore.
8. Svozil, K. (1998). Quantum Logic, Singapore, Springer.
9. 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.
10. Wright, R. (1990). Generalized urn models. Foundations of Physics 20, 881-903.