Gå direkt till innehållet
  1. Böcker
  2. Böcker på engelska

Bounded Queries in Recursion Theory

1 158 kr
Lägsta pris på PriceRunner

The natural measure of difficulty of a function is the amount of time needed to compute it (as a function of the length of the input). In recursion theory, by contrast, a function is considered to be easy to compute if there exists some algorithm that computes it.

ISBN
9780817639662
Språk
engelska
Vikt
518 gram
Utgivningsdatum
1998-12-23
Sidor
353