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… 
2007
2007
An Interactive Approach to Pose-Assisted and Appearance-based Segmentation of Humans
An interactive human segmentation approach is described. Given regions of interest provided by users, the approach iteratively… 
2006
2006
Recognition of Multi-Object Events Using Attribute Grammars
We present a method for representing and recognizing visual events using attribute grammars. In contrast to conventional grammars… 
Highly Cited
2003
Highly Cited
2003
Modification of vehicle handling characteristics via steer-by-wire
This paper presents a physically intuitive method for altering a vehicle handling characteristics through active steering… 
2003
2003
Probabilistic simulation-based analysis of complex real-time systems
Many industrial real-time systems have evolved over a long period of time and were initially so simple that it was possible to… 
2002
2002
Interacting multiple model (IMM) Kalman filters for robust high speed human motion tracking
Accurate and robust tracking of humans is of growing interest in the image processing and computer vision communities. The… 
Highly Cited
2001
Highly Cited
2001
Self-aware services: using Bayesian networks for detecting anomalies in Internet-based services
We propose a general architecture and implementation for the autonomous assessment of the health of arbitrary service elements… 
Highly Cited
1998
Highly Cited
1998
A method of combining multiple probabilistic classifiers through soft competition on different feature sets
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… 
Highly Cited
1968
Highly Cited
1968
Electron Microscopy of Cells and Tissues
I read this book the same weekend that the Packers took on the Rams, and the experience of the latter event, obviously, colored… 
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)