Bounded Queries Recursion Theory by Levine William (17 results)

Hardcover. Condition: Good. First Edition. No DJ. Ex University of California, Berkeley library book with usual library markings. Binding is tight, text clean. From the back cover: One of the major concerns of theoretical computer science is the classification of problems in terms of how hard they are. 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). Other resources, such as space, have also been considered. In recursion theory, by contrast, a function is considered to be easy to compute if there exists some algorithm that computes it.…

Condition: Used. pp. 376.

Condition: Used. pp. 376 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam.

Condition: New. In English.

Condition: New. In English.

Condition: Used. pp. 376.

Condition: New.

Condition: New. pp. 374.

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - One of the major concerns of theoretical computer science is the classifi cation of problems in terms of how hard they are. 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). Other resources, such as space, have also been considered. In recursion theory, by contrast, a function is considered to be easy to compute if there exists some algorithm that computes it. We wish to classify functions that are hard, i.e., not computable, in a quantitative way. We cannot use time or space, since the functions are not even computable. We cannot use Turing degree, since this notion is not quantitative. Hence we need a new notion of complexity-much like time or spac~that is quantitative and yet in some way captures the level of difficulty (such as the Turing degree) of a function.…

Taschenbuch. Condition: Neu. Bounded Queries in Recursion Theory | William Levine (u. a.) | Taschenbuch | Progress in Computer Science and Applied Logic | xiii | Englisch | 2013 | Birkhäuser | EAN 9781461268482 | Verantwortliche Person für die EU: Springer Basel AG in Springer Science + Business Media, Heidelberger Platz 3, 14197 Berlin, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.…

Gebunden. Condition: New.

Paperback. Condition: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Hardcover. Condition: gut. 1999. Bounded Queries in Recursion Theory (Progress in Computer Science and Applied Logic, 16, Band 16) In englischer Sprache. pages.

Condition: new. Questo è un articolo print on demand.

Condition: New. Print on Demand pp. 374 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam.

Condition: New. PRINT ON DEMAND pp. 374.

Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -One of the major concerns of theoretical computer science is the classifi cation of problems in terms of how hard they are. 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). Other resources, such as space, have also been considered. In recursion theory, by contrast, a function is considered to be easy to compute if there exists some algorithm that computes it. We wish to classify functions that are hard, i.e., not computable, in a quantitative way. We cannot use time or space, since the functions are not even computable. We cannot use Turing degree, since this notion is not quantitative. Hence we need a new notion of complexity-much like time or spac~that is quantitative and yet in some way captures the level of difficulty (such as the Turing degree) of a function.Springer Nature c/o IBS, Benzstrasse 21, 48619 Heek 372 pp. Englisch.…