Computational Complexity of Probabilistic Turing Machines
- 1 December 1977
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 6 (4) , 675-695
- https://doi.org/10.1137/0206049
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- A Course in Computational Probability and StatisticsPublished by Springer Nature ,1971
- Probabilistic Turing machines and computabilityProceedings of the American Mathematical Society, 1969
- A Machine-Independent Theory of the Complexity of Recursive FunctionsJournal of the ACM, 1967
- On a combinatorial conjecture of ErdösJournal of Combinatorial Theory, 1966
- One-tape, off-line Turing machine computationsInformation and Control, 1965
- Real time computationIsrael Journal of Mathematics, 1963
- Probabilistic automataInformation and Control, 1963
- Gödel numberings of partial recursive functionsThe Journal of Symbolic Logic, 1958
- Computability by Probabilistic MachinesPublished by Walter de Gruyter GmbH ,1956
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of ObservationsThe Annals of Mathematical Statistics, 1952