Computability by Probabilistic Turing Machines

DOI10.2307/1996005MaRDI QIDQ5658085zbMATH OpenOpenAlexFDO

Authors Eugene S. Santos

Publication date 1971

Full work available at URL https://doi.org/10.2307/1996005

Mathematics Subject Classification ID

Turing machines and related notions (03D10) Recursive functions and relations, subrecursive hierarchies (03D20) Formal languages and automata (68Q45)

Cites work

• Fuzzy sets
• scientific article; zbMATH DE number 3126031 (Why is no real title available?)
• scientific article; zbMATH DE number 3131080 (Why is no real title available?)
• scientific article; zbMATH DE number 3151099 (Why is no real title available?)
• scientific article; zbMATH DE number 3310089 (Why is no real title available?)
• scientific article; zbMATH DE number 3060775 (Why is no real title available?)
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Probabilistic automata
• Probabilistic Turing Machines and Computability
• Reduced forms for stochastic sequential machines
• Some definitional suggestions for automata theory

Cited in

(12)

• Introduction to the concept of recursiveness of fuzzy functions
• Probabilistic automata
• Fuzzy and probabilistic programs
• Efficient simulations by a biased coin
• A thesis for interaction
• Characterizations of semantic domains for randomized algorithms
• Probabilistic rewriting: normalization, termination, and unique normal forms
• Probabilistic rewriting and asymptotic behaviour: on termination and unique normal forms
• Multihead two-way probabilistic finite automata (extended abstract)
• On counting propositional logic and Wagner's hierarchy
• Multihead two-way probabilistic finite automata
• Probabilistic Turing machines and recursively enumerable Dedekind cuts

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)