Higher-Order Computability (Theory and Applications of Computability) - Image 1

£116.82

Springer Higher-Order Computability (Theory and Applications of Computability)

Name: Higher-Order Computability (Theory and Applications of Computability)
Brand: Springer
Price: 116.82 GBP
Availability: InStock

2 black & white illustrations, biography

Computer Science

It has never been this cheap. We have no record of a lower price.

£117 today · cheaper than every other day in the last 3 months

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 55 days · 55 data points (no recent data)

Historical

Generating forecast…

Price Distribution

Price distribution over 55 days • 2 price levels

Days at Price

Current Price

Price Analysis

Most common price: £117 (44 days, 80.0%)

Price range: £117 - £118

Price levels: 2 different prices over 55 days

Description

This book offers a self-contained exposition of the theory of computability in a higher-order context, where 'computable operations' may themselves be passed as arguments to other computable operations. The subject originated in the 1950s with the work of Kleene, Kreisel and others, and has since expanded in many different directions under the influence of workers from both mathematical logic and computer science. The ideas of higher-order computability have proved valuable both for elucidating the constructive content of logical systems, and for investigating the expressive power of various higher-order programming languages. In contrast to the well-known situation for first-order functions, it turns out that at higher types there are several different notions of computability competing for our attention, and each of these has given rise to its own strand of research. In this book, the authors offer an integrated treatment that draws together many of these strands within a unifying framework, revealing not only the range of possible computability concepts but the relationships between them. The book will serve as an ideal introduction to the field for beginning graduate students, as well as a reference for advanced researchers

Product Specifications

Brand: Springer
Model: 2 black & white illustrations, biography
Format: hardcover
ASIN: 3662479915
Category: Books > Subjects > Computing & Internet > Computer Science
Domain: Amazon UK
Publication Date: 17 November 2015
Listed Since: 17 June 2015

Barcode

No barcode data available

Springer Higher-Order Computability (Theory and Applications of Computability)

It has never been this cheap. We have no record of a lower price.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Springer Higher-Order Computability Theory and Applications

Computability Theory: 26 (Chapman Hall/CRC Mathematics Series)

Computability Theory: An Introduction to Recursion Theory

Programs as Diagrams: From Categorical Computability to Computable Categories (Theory and Applications of Computability)

Computability

A Programming Approach to Computability (Monographs in Computer Science)

Logical Approaches to Computational Barriers: Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006, Proceedings: 3988 (Lecture Notes in Computer Science, 3988)

Computability In Context: Computation And Logic In The Real World

Introduction to Metamathematics (Bibliotheca Mathematica)

Introduction to the Theory of Computation

Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexity

Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexity

MIT Press Computability and Complexity - Theory of Computation

Introduction to the Theory of Computation

The Foundations of Computability Theory

Theory of Computation

Reflections on the Work of C.A.R. Hoare

Effective Mathematics of the Uncountable: 41 (Lecture Notes in Logic, Series Number 41)

Computability and Logic

Models of Computation (Texts in Theoretical Computer Science. An EATCS Series)

Models of Computation (Texts in Theoretical Computer Science. An EATCS Series)

Turing Computability: Theory and Applications (Theory and Applications of Computability)

New Computational Paradigms: First Conference on Computability in Europe, CiE 2005, Amsterdam, The Netherlands, June 8-12, 2005, Proceedings: 3526 (Lecture Notes in Computer Science, 3526)

The Calculus of Computation: Decision Procedures with Applications to Verification