Computability by Probabilistic Turing Machines
From MaRDI portal
Publication:5658085
DOI10.2307/1996005zbMATH Open0246.02030OpenAlexW4254964781MaRDI QIDQ5658085FDOQ5658085
Publication date: 1971
Full work available at URL: https://doi.org/10.2307/1996005
Formal languages and automata (68Q45) Recursive functions and relations, subrecursive hierarchies (03D20) Turing machines and related notions (03D10)
Cites Work
- Fuzzy sets
- Probabilistic automata
- On Computable Numbers, with an Application to the Entscheidungsproblem
- Probabilistic Turing Machines and Computability
- Reduced forms for stochastic sequential machines
- Some definitional suggestions for automata theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (12)
- Introduction to the concept of recursiveness of fuzzy functions
- Fuzzy and probabilistic programs
- Multihead two-way probabilistic finite automata
- Probabilistic automata
- Title not available (Why is that?)
- On counting propositional logic and Wagner's hierarchy
- A thesis for interaction
- Title not available (Why is that?)
- Probabilistic Turing machines and recursively enumerable Dedekind cuts
- Efficient simulations by a biased coin
- Multihead two-way probabilistic finite automata
- Characterizations of semantic domains for randomized algorithms
This page was built for publication: Computability by Probabilistic Turing Machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5658085)
