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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
In the present paper, the definition of probabilistic Turing machines is extended to allow the introduction of relative… (More)
Is this relevant?
Highly Cited
2005
Highly Cited
2005
The main result in this paper establishes the energy savings derived by using probabilistic AND as well as NOT gates constructed… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2002
Highly Cited
2002
MOTIVATION Our goal is to construct a model for genetic regulatory networks such that the model class: (i) incorporates rule… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Voice conversion, as considered in this paper, is defined as modifying the speech signal of one speaker (source speaker) so that… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1986
Highly Cited
1986
Communication is a bottleneck in many distributed computations. In VLSI, communication constraints dictate lower bounds on the… (More)
Is this relevant?
Highly Cited
1983
Highly Cited
1983
It is shown that a probabilistic Turing acceptor or transducer running within space bound S can be simulated by a time S 2… (More)
Is this relevant?
1981
1981
For tape constructible functions S(n)≥log n, if a language L is accepted by an S(n) tape bounded probabilistic Turing machine… (More)
Is this relevant?
1978
1978
The tape requirements of probabilistic and deterministic Turing machine transducers are polynomially related. 
Is this relevant?
1978
1978
We examine the computational complexity of testing and nding small plans in probabilistic planning domains with both at and… (More)
Is this relevant?
1977
1977
We call attention to the problem of proving lower bounds on probabilistic Turing machine camgutations. It is shown that any… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?