Bounded Queries in Recursion Theory: 16 (Progress in Computer Science and Applied Logic, 16) - Image 1

£76.42

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

Name: Bounded Queries in Recursion Theory: 16 (Progress in Computer Science and Applied Logic, 16)
Brand: Birkhauser
Price: 76.42 GBP
Availability: InStock

Computer Science

This is the most expensive it has ever been. Walk away.

£76 today · previous high £76 · all-time low £73

NEW HERE?

Amazon shows you one price. We show you all of them.

Tosheroon watches Amazon prices so you don't have to. Every product on Amazon has a price history — we make it visible. Set the price you'd actually pay, and we'll email you the second it gets there. No app, no account, one email.

WHAT'S ON THIS PAGE

↓ Price chart
when this has been cheap or pricey

↓ Forecast
where the price is heading next

↓ Statistics
all-time high & low, recent range

↑ Price alert
name your number, we'll email you

Price History & Forecast

Grey patches = out of stock. Cheaper = lower on the chart. Hover for exact prices.

Last 78 days · 78 data points (no recent data)

Historical

Generating forecast…

Price Distribution

Price distribution over 78 days • 2 price levels

Days at Price

Current Price

Price Analysis

Most common price: £76 (40 days, 51.3%)

Price range: £73 - £76

Price levels: 2 different prices over 78 days

Description

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. Review "Ideal for an advanced undergraduate or beginning graduate student who has some exposure to basic computability theory and wants to see what one can do with it. The questions asked are interesting and can be easily understood and the proofs can be followed without a large amount of training in computability theory." --Sigact News

Product Specifications

Brand: Birkhauser
Format: paperback
ASIN: 1461268486
Category: Books > Subjects > Computing & Internet > Computer Science
Domain: Amazon UK
Publication Date: 13 July 2013
Listed Since: 07 November 2013

Barcode

No barcode data available

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

This is the most expensive it has ever been. Walk away.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

The Foundations of Computability Theory

Comparative Metric Semantics of Programming Languages: Nondeterminism and Recursion (Progress in Theoretical Computer Science)

Computable Analysis: An Introduction (Texts in Theoretical Computer Science. An EATCS Series)

Cambridge Logical Foundations of Proof Complexity Book

New Computational Paradigms: Changing Conceptions of What is Computable

An Introduction to Formal Languages and Machine Computation

Solving Higher-Order Equations: From Logic to Programming (Progress in Theoretical Computer Science)

Neural Networks and Analog Computation: Beyond the Turing Limit (Progress in Theoretical Computer Science)

Computability and Models: Perspectives East and West (University Series in Mathematics)

First-Order Schemata and Inductive Proof Analysis (Computer Science Foundations and Applied Logic)

Super-Recursive Algorithms (Monographs in Computer Science)

Handbook of Computability Theory (Volume 140) (Studies in Logic and the Foundations of Mathematics, Volume 140)

Cryptographic Applications of Analytic Number Theory: Complexity Lower Bounds and Pseudorandomness: 22 (Progress in Computer Science and Applied Logic, 22)

Cryptographic Applications of Analytic Number Theory: Complexity Lower Bounds and Pseudorandomness: 22 (Progress in Computer Science and Applied Logic, 22)

LMS: 45 Recursion Theory, Applns: Its Generalisations & Applications, Proceedings of Logic Colloquim '79, Leeds, Aug. 1979 (London Mathematical Society Lecture Note Series, Series Number 45)

Differential Equations with Symbolic Computation (Trends in Mathematics)

Logics for Computer Science: Classical and Non-Classical

Concurrency Theory: Calculi an Automata for Modelling Untimed and Timed Concurrent Systems

Theory of Reversible Computing (Monographs in Theoretical Computer Science. An EATCS Series)

Advanced Topics in Bisimulation and Coinduction: 52 (Cambridge Tracts in Theoretical Computer Science, Series Number 52)

Turing’s Revolution: The Impact of His Ideas about Computability

Turing’s Revolution: The Impact of His Ideas about Computability

Handbook of Parallel Constraint Reasoning

Handbook of Complex Variables