Probabilistic Turing Machines and Computability

DOI10.2307/2037463MaRDI QIDQ5579493zbMATH OpenOpenAlexFDO

Authors Eugene S. Santos

Publication date 1969

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

zbMATH Keywords

recursion theory, constructive mathematics

Cites work

• scientific article; zbMATH DE number 3131080 (Why is no real title available?)
• Maximin sequential-like machines and chains
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Probabilistic automata
• Reduced forms for stochastic sequential machines

Cited in

(19)

• Randomized algorithms in combinatorial optimization: A survey
• Probabilistic automata
• On tape-bounded probabilistic Turing machine acceptors
• A probabilistic model of computing with words
• Bayesian estimation and the Kalman filter
• On measure quantifiers in first-order arithmetic
• Confluent complement: an algorithm for the intersection of face ideals
• On higher-order probabilistic subrecursion
• On using probabilistic Turing machines to model participants in cryptographic protocols
• Characterizations of semantic domains for randomized algorithms
• On higher-order probabilistic subrecursion
• On the termination problem for probabilistic higher-order recursive programs
• Computability by Probabilistic Turing Machines
• On counting propositional logic and Wagner's hierarchy
• Universality of SN P systems with stochastic application of rules
• Towards logical foundations for probabilistic computation
• Multihead two-way probabilistic finite automata
• Enumerating error bounded polytime algorithms through arithmetical theories
• Probabilistic Turing machines and recursively enumerable Dedekind cuts

This page was built for publication: Probabilistic Turing Machines and Computability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5579493)