COMPUTATIONAL PROSPECTS OF INFINITY - PART I: TUTORIALS (Lecture Notes Series, Institute for Mathematical Sciences, National University of Singapore) - Image 1

£58.04

Scientific Publishing COMPUTATIONAL PROSPECTS OF INFINITY - PART I: TUTORIALS (Lecture Notes Series, Institute for Mathematical Sciences, National University of Singapore)

Name: COMPUTATIONAL PROSPECTS OF INFINITY - PART I: TUTORIALS (Lecture Notes Series, Institute for Mathematical Sciences, National University of Singapore)
Brand: Scientific Publishing
Price: 58.04 GBP
Availability: InStock

Architecture & Microprocessors

This is the usual price. Wait for it to drop, or tell us your number.

£58 today · usual range £0–£0 · best ever £45

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 629 days • 629 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 629 days • 4 price ranges

Days at Price

Current Price

Price Analysis

Most common range: £45-54 (541 days, 86.0%)

Price range: £45 - £89

Price levels: 4 price ranges over 629 days

Description

This volume presents the written versions of the tutorial lectures given at the Workshop on Computational Prospects of Infinity, held from 18 June to 15 August 2005 at the Institute for Mathematical Sciences, National University of Singapore. It consists of articles by four of the leading experts in recursion theory (computability theory) and set theory. The survey paper of Rod Downey provides a comprehensive introduction to algorithmic randomness, one of the most active areas of current research in recursion theory. Theodore A Slaman's article is the first printed account of the ground-breaking work of Slaman-Woodin and Slaman-Shore on the definability of the Turing jump. John Steel presents some results on the properties of derived models of mice, and on the existence of mice with large derived models. The study was motivated by some of the well-known Holy Grails in inner model theory, including the Mouse Set Conjecture. In his presentation, W Hugh Woodin gives an outline of an expanded version (unpublished) on suitable extender sequences, a subject that was developed in the attempt to understand inner model theory for large cardinals beyond the level of superstrong cardinals.The volume serves as a useful guide for graduate students and researchers in recursion theory and set theory to some of the most important and significant developments in these subjects in recent years.

Product Specifications

Brand: Scientific Publishing
Format: hardcover
ASIN: 9812796533
Category: Books > Subjects > Computing & Internet > Computer Science > Architecture & Microprocessors
Domain: Amazon UK
Release Date: 14 July 2008
Listed Since: 03 March 2008

Barcode

No barcode data available

Scientific Publishing COMPUTATIONAL PROSPECTS OF INFINITY - PART I: TUTORIALS (Lecture Notes Series, Institute for Mathematical Sciences, National University of Singapore)

This is the usual price. Wait for it to drop, or tell us your number.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Classical Recursion Theory, Volume II (Volume 143) (Studies in Logic and the Foundations of Mathematics, Volume 143)

COMPUTATIONAL PROSPECTS OF INFINITY - PART II: PRESENTED TALKS: 15 (Lecture Notes Series, Institute for Mathematical Sciences, National University of Singapore)

Classical Recursion Theory: The Theory of Functions and Sets of Natural Numbers: Volume 125 (Studies in Logic and the Foundations of Mathematics, Volume 125)

Recursive Functions and Metamathematics: Problems of Completeness and Decidability, Gödel’s Theorems: 286 (Synthese Library, 286)

Cambridge Higher Recursion Theory 2 - Perspectives in Logic

Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexity

Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexity

Computability: An Introduction to Recursive Function Theory

Models of Peano Arithmetic: 15 (Oxford Logic Guides)

Recursion Theory, Godel's Theorems, Set Theory, Model Theory (Mathematical Logic: A Course With Exercises, Part II)

Introduction to Metamathematics (Bibliotheca Mathematica)

Mathematical Foundations of Computer Science

Logic and Combinatorics: Joint Summer Research Conference on Applications of Mathematical Logic to Finite Combinatorics (Contemporary Mathematics)

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

Algorithmic Randomness and Complexity: 0 (Theory and Applications of Computability)

Mathematics in Programming

Constructive Models (Siberian School of Algebra and Logic)

Constructive Models (Siberian School of Algebra and Logic)

Forcing, Iterated Ultrapowers, And Turing Degrees: 29 (Lecture Notes Series, Institute for Mathematical Sciences, National University of Singapore)

Computability Theory and Its Applications: Current Trends and Open Problems (Contemporary Mathematics)

Computability and Logic

Mathematics in Computing: An Accessible Guide to Historical, Foundational and Application Contexts (Undergraduate Topics in Computer Science)

Finite Structures with Few Types. (AM–152), Volume 152 (Annals of Mathematics Studies, 152)

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