On tape-bounded probabilistic Turing machine acceptors
- 31 December 1981
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 16 (1), 75-91
- https://doi.org/10.1016/0304-3975(81)90032-3
Abstract
No abstract availableKeywords
Funding Information
- National Science Foundation (MCS 7905086)
This publication has 5 references indexed in Scilit:
- Computational Complexity of Probabilistic Turing MachinesSIAM Journal on Computing, 1977
- Fast Parallel Matrix Inversion AlgorithmsSIAM Journal on Computing, 1976
- A characterization of the power of vector machinesJournal of Computer and System Sciences, 1976
- Relationships between nondeterministic and deterministic tape complexitiesJournal of Computer and System Sciences, 1970
- Probabilistic Turing machines and computabilityProceedings of the American Mathematical Society, 1969