Skip to search formSkip to main contentSkip to account menu

Probabilistic Turing machine

Known as: Two sided error, One sided error machine, Probabilistic Turing machines 
In computability theory, a probabilistic Turing machine is a non-deterministic Turing machine which chooses between the available transitions at each… 
Wikipedia (opens in a new tab)

Related topics

Related topics

27 relations
Automata theoryBPL (complexity)BPP (complexity)Church–Turing thesis

Broader (1)

Turing machine

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Modelación probabilista de pérdidas económicas por sismo para la estimación de la vulnerabilidad fiscal del estado y la gestión financiera del riesgo soberano
El riesgo sísmico y en general los desastres futuros que puede sufrir una ciudad, una región o un país significan una obligación… 
2012
2012
A visual tool for bayesian data analysis: the impact of smoothing on naive bayes text classifiers
Naive-Bayes (NB) classifiers are simple probabilistic classifiers still widely used in supervised learning due to their tradeoff… 
2012
2012
Probabilistic Turing Machine and Landauer Limit
We show the equivalence between a probabilistic Turing machine and the time evolution of a one-dimensional Ising model, the… 
2008
2008
Probabilistic clustering by random swap algorithm
We formulate probabilistic clustering method based on a sequence of random swaps of cluster centroids. We show that the algorithm… 
2007
2007
Active Learning and Adaptive Sampling for Non-Parametric Inference
Active Learning and Adaptive Sampling for Non-Parametric Inference by Rui M. Castro This thesis presents a general discussion of… 
2002
2002
Selective Bayesian Classifier: Feature Selection For The Naive Bayesian Classifier Using Decision Trees
It is known that Naive Bayesian classifier (NB) works very well on some domains, and poorly on some. The performance of NB… 
1995
1995
Probabilistic Relaxation as an Optimizer
Probabilistic Relaxation with product support has been shown to have advantages over 'traditional' probabilistic relaxation… 
Highly Cited
1989
Highly Cited
1989
Recognizing Hand-Printed Letters and Digits
We are developing a hand-printed character recognition system using a multi-layered neural net trained through backpropagation… 
1983
1983
Lower bounds on graph threading by probabilistic machines
It is likely that reliable and fast space-bounded probabilistic acceptors are less powerful than nondeterministic ones. We… 
1977
1977
A lower bound to palindrome recognition by probabilistic Turing machines
We call attention to the problem of proving lower bounds on probabilistic Turing machine computations. It is shown that any… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)