Bounded Queries in Recursion Theory - Progress in Computer Science and Applied Logic - William Levine - Books - Birkhauser Boston Inc - 9780817639662 - December 23, 1998
In case cover and title do not match, the title is correct

Bounded Queries in Recursion Theory - Progress in Computer Science and Applied Logic 1999 edition

William Levine

Price
₺ 4,206
excl. VAT

Ordered from remote warehouse

Expected delivery Jul 9 - 21

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 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.

353 pages, biography

Media Books     Hardcover Book   (Book with hard spine and cover)
Released December 23, 1998
ISBN13 9780817639662
Publishers Birkhauser Boston Inc
Pages 353
Dimensions 155 × 235 × 22 mm   ·   703 g
Language English  

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