Bounded Queries in Recursion Theory - Progress in Computer Science and Applied Logic - William Levine - Books - Springer-Verlag New York Inc. - 9781461268482 - July 13, 2013
In case cover and title do not match, the title is correct

Bounded Queries in Recursion Theory - Progress in Computer Science and Applied Logic Softcover reprint of the original 1st ed. 1999 edition

William Levine

Price
元 762
excl. VAT

Ordered from remote warehouse

Expected delivery Jul 10 - 22

Our customers say:

14-day return policy in accordance with European consumer protection law
Top ranking on Trustpilot
Add to your iMusic wish list

Also available as:

Bounded Queries in Recursion Theory - Progress in Computer Science and Applied Logic Softcover reprint of the original 1st ed. 1999 edition

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.

366 pages, biography

Media Books     Paperback Book   (Book with soft cover and glued back)
Released July 13, 2013
ISBN13 9781461268482
Publishers Springer-Verlag New York Inc.
Pages 353
Dimensions 155 × 235 × 20 mm   ·   521 g
Language English  

See all of William Levine ( e.g. Paperback Book and Hardcover Book )