About: Probabilistic Turing machine

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Probabilistic Turing machine Goto Sponge NotDistinct Permalink

An Entity of Type : dbo:Software, within Data Space : el.dbpedia.org associated with source document(s)

In theoretical computer science, a probabilistic Turing machine is a non-deterministic Turing machine that chooses between the available transitions at each point according to some probability distribution. As a consequence, a probabilistic Turing machine can—unlike a deterministic Turing Machine—have stochastic results; that is, on a given input and instruction state machine, it may have different run times, or it may not halt at all; furthermore, it may accept an input in one execution and reject the same input in another execution.

Attributes	Values
rdf:type	software
rdfs:label	Probabilistic Turing machine (en)
rdfs:comment	In theoretical computer science, a probabilistic Turing machine is a non-deterministic Turing machine that chooses between the available transitions at each point according to some probability distribution. As a consequence, a probabilistic Turing machine can—unlike a deterministic Turing Machine—have stochastic results; that is, on a given input and instruction state machine, it may have different run times, or it may not halt at all; furthermore, it may accept an input in one execution and reject the same input in another execution. (en)
sameAs	Probabilistic Turing machine Probabilistic Turing machine
dbp:wikiPageUsesTemplate	dbt:= dbt:Cite_book dbt:Reflist dbt:Use_dmy_dates dbt:Noitalic dbt:Unsolved dbt:Turing
Subject	Randomized algorithms Turing machine Models of computation
gold:hypernym	Machine
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Probabilistic_Turing_machine?oldid=1054295377&ns=0
Wikipage page ID	197812 (xsd:integer)
page length (characters) of wiki page	7671 (xsd:nonNegativeInteger)
Wikipage revision ID	1054295377 (xsd:integer)
has abstract	In theoretical computer science, a probabilistic Turing machine is a non-deterministic Turing machine that chooses between the available transitions at each point according to some probability distribution. As a consequence, a probabilistic Turing machine can—unlike a deterministic Turing Machine—have stochastic results; that is, on a given input and instruction state machine, it may have different run times, or it may not halt at all; furthermore, it may accept an input in one execution and reject the same input in another execution. In the case of equal probabilities for the transitions, probabilistic Turing machines can be defined as deterministic Turing machines having an additional "write" instruction where the value of the write is uniformly distributed in the Turing Machine's alphabet (generally, an equal likelihood of writing a "1" or a "0" on to the tape). Another common reformulation is simply a deterministic Turing machine with an added tape full of random bits called the "random tape". A quantum computer is another model of computation that is inherently probabilistic. (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Probabilistic_Turing_machine
is Wikipage redirect of	Probabilistic Turing Machine Minimal error Minimal error machine Random Turing machine One-sided error machine One sided error One sided error machine Probabilistic Turing machines Probabilistic computation Two-sided error machine Two sided error Two sided error machine
is Link from a Wikipage to another Wikipage of	Forking lemma List of terms relating to algorithms and data structures List of things named after Alan Turing Locally testable code NL (complexity) Nondeterministic Turing machine Automata theory BPL (complexity) BPP (complexity) BQP Branches of science Catalog of articles in probability theory Church–Turing thesis Hypercomputation List of probability topics Complexity class Algorithmic complexity Edward F. Moore List of computability and complexity topics Next-bit test Hadamard transform Interactive proof system Multitape Turing machine Minimal error Minimal error machine

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (72 GB total memory, 1 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software