PP (complexity) - Definition

Definition

A language L is in PP if and only if there exists a probabilistic Turing machine M, such that

  • M runs for polynomial time on all inputs
  • For all x in L, M outputs 1 with probability strictly greater than 1/2
  • For all x not in L, M outputs 1 with probability less than or equal to 1/2.

Alternatively, PP can be defined using only deterministic Turing machines. A language L is in PP if and only if there exists a polynomial p and deterministic Turing machine M, such that

  • M runs for polynomial time on all inputs
  • For all x in L, the fraction of strings y of length p(|x|) which satisfy M(x,y) = 1 is strictly greater than 1/2
  • For all x not in L, the fraction of strings y of length p(|x|) which satisfy M(x,y) = 1 is less than or equal to 1/2.

In both definitions, "less than or equal" can be changed to "less than" (see below), and the threshold 1/2 can be relaced by any fixed rational number in (0,1), without changing the class.

Read more about this topic:  PP (complexity)

Famous quotes containing the word definition:

    One definition of man is “an intelligence served by organs.”
    Ralph Waldo Emerson (1803–1882)

    The man who knows governments most completely is he who troubles himself least about a definition which shall give their essence. Enjoying an intimate acquaintance with all their particularities in turn, he would naturally regard an abstract conception in which these were unified as a thing more misleading than enlightening.
    William James (1842–1910)

    According to our social pyramid, all men who feel displaced racially, culturally, and/or because of economic hardships will turn on those whom they feel they can order and humiliate, usually women, children, and animals—just as they have been ordered and humiliated by those privileged few who are in power. However, this definition does not explain why there are privileged men who behave this way toward women.
    Ana Castillo (b. 1953)