Holger Austinat

Learn More
An (m, n)-computation of a function f is given by a deterministic Turing machine which on n pairwise different inputs produces n output values where at least m of the n values are in accordance with f. In such a case we say that the Turing machine computes f with frequency ≥ m/n. The most prominent result for frequency computations is due to Trakhtenbrot:(More)
  • 1