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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
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… 
Highly Cited
2009
Highly Cited
2009
This paper investigates the tracking performance of continuous-time, multi-input multi-output, linear timeinvariant systems in… 
2008
2008
We will describe three kinds of probabilistic induction problems, and give general solutions for each , with associated… 
Highly Cited
2003
Highly Cited
2003
This paper presents a physically intuitive method for altering a vehicle handling characteristics through active steering… 
2003
2003
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
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
We propose a general architecture and implementation for the autonomous assessment of the health of arbitrary service elements… 
1977
1977
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
I read this book the same weekend that the Packers took on the Rams, and the experience of the latter event, obviously, colored…