# Probabilistic Turing machine

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2010

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

- IEEE Transactions on Computers
- 2005

The main result in this paper establishes the energy savings derived by using probabilistic AND as well as NOT gates constructedâ€¦Â (More)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

- Bioinformatics
- 2002

MOTIVATION
Our goal is to construct a model for genetic regulatory networks such that the model class: (i) incorporates ruleâ€¦Â (More)

Is this relevant?

Highly Cited

1998

Highly Cited

1998

- IEEE Trans. Speech and Audio Processing
- 1998

Voice conversion, as considered in this paper, is defined as modifying the speech signal of one speaker (source speaker) so thatâ€¦Â (More)

Is this relevant?

Highly Cited

1986

Highly Cited

1986

- J. Comput. Syst. Sci.
- 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

- Information and Control
- 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

- STOC
- 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

- 19th Annual Symposium on Foundations of Computerâ€¦
- 1978

The tape requirements of probabilistic and deterministic Turing machine transducers are polynomially related.Â

Is this relevant?

1978

1978

- FOCS
- 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

- 1977

We call attention to the problem of proving lower bounds on probabilistic Turing machine camgutations. It is shown that anyâ€¦Â (More)

Is this relevant?