Probabilistic Turing machines and computability
HTML articles powered by AMS MathViewer
- by Eugene S. Santos
- Proc. Amer. Math. Soc. 22 (1969), 704-710
- DOI: https://doi.org/10.1090/S0002-9939-1969-0249221-4
- PDF | Request permission
References
- J. W. Carlyle, Reduced forms for stochastic sequential machines, J. Math. Anal. Appl. 7 (1963), 167–175. MR 180460, DOI 10.1016/0022-247X(63)90045-3
- Martin Davis, Computability and unsolvability, McGraw-Hill Series in Information Processing and Computers, McGraw-Hill Book Co., Inc., New York-Toronto-London, 1958. MR 124208 M. O. Rabin, Probabilistic automata, Information and Control 6 (1963), 230-245.
- Eugene Santos, Maximin sequential-like machines and chains, Math. Systems Theory 3 (1969), 300–309. MR 266701, DOI 10.1007/BF01691059 A. M. Turing, On computable numbers, with an application to the entscheidungs problem, Proc. London Math. Soc. Ser. 2 42 (1936), 230-265.
- Vladeta Vučković, Basic theorems on Turing algorithms, Publ. Inst. Math. (Beograd) (N.S.) 1(15) (1961), 31–65 (1962). MR 204289
Bibliographic Information
- © Copyright 1969 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 22 (1969), 704-710
- MSC: Primary 94.45
- DOI: https://doi.org/10.1090/S0002-9939-1969-0249221-4
- MathSciNet review: 0249221