Bounded Queries in Recursion Theory: 16 (Progress in Computer Science and Applied Logic)

by G. Martin (Author), W. Gasarch (Author), William I. Gasarch (Author)

New
Illustrated
1998
$177.70

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.

Synopsis

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.

$177.70

Quantity

20+ in stock

More Information

Format: Illustrated
Pages: 376
Edition: 1999
Publisher: Birkhäuser
Published: 23 Dec 1998
ISBN 10: 0817639667
ISBN 13: 9780817639662

Bounded Queries in Recursion Theory: 16 (Progress in Computer Science and Applied Logic)

New

$177.70

Synopsis

$177.70

More Information