Capa do artigo Bounded Queries In Recursion Theory
10% OFF

Bounded Queries In Recursion Theory eBook

by Georgia Martin e William Levine
language: english
Publisher: BIRKHAUSER BOSTON, December of 2012 ‧
118,59€
10% OFF CARD
IMMEDIATE AVAILABILITY
Ebook for ADE
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.

Bounded Queries In Recursion Theory

by Georgia Martin e William Levine

Property Description
ISBN: 9781461206354
Publisher: BIRKHAUSER BOSTON
Release Date: December of 2012
Language: English
Format: eBook
File Format and Compatibility: PDF para ADE
Collection: Progress In Computer Science And Applied Logic
Categories: eBooks in English > Science > Mathematics
EAN: 9781461206354

BOOKS FROM THE SAME COLLECTION

SEE MORE TITLES FROM THIS COLLECTION