Deterministic simulation of tape-bounded probabilistic Turing machine transducers

DOI10.1016/0304-3975(80)90063-8zbMath0442.68034OpenAlexW2029800489MaRDI QIDQ1143792

S. H. Smith

Publication date: 1980

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(80)90063-8

zbMATH Keywords

acception of languagestape-bounded probabilistic machine transducers

Mathematics Subject Classification ID

Related Items (6)

Division in idealized unit cost RAMs ⋮ Relationships among $PL$, $\#L$, and the determinant ⋮ A survey of space complexity ⋮ The time-precision tradeoff problem on on-line probabilistic Turing machines ⋮ Space-bounded hierarchies and probabilistic computations ⋮ Probabilistic Turing machines and recursively enumerable Dedekind cuts

Cites Work

• On tape-bounded probabilistic Turing machine acceptors
• A characterization of the power of vector machines
• Fast Parallel Matrix Inversion Algorithms
• Computational Complexity of Probabilistic Turing Machines
• Unnamed Item

This page was built for publication: Deterministic simulation of tape-bounded probabilistic Turing machine transducers