£94.50

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

Mathematical Logic

Price data last checked 63 day(s) ago - refreshing...

View at Amazon

Price History & Forecast

Last 28 days • 28 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 28 days • 1 price levels

Days at Price

Price Analysis

Most common price: £95 (28 days, 100.0%)

Price range: £95 - £95

Price levels: 1 different prices over 28 days

Description

This collection of articles presents a snapshot of the status of computability theory at the end of the millennium and a list of fruitful directions for future research. The papers represent the works of experts in the field who were invited speakers at the AMS-IMS-SIAM Joint Summer Conference on Computability Theory and Applications held at the University of Colorado (Boulder). The conference focused on open problems in computability theory and on some related areas in which the ideas, methods, and/or results of computability theory play a role.Some presentations are narrowly focused; others cover a wider area. Topics included from 'pure' computability theory are the computably enumerable degrees (M. Lerman), the computably enumerable sets (P. Cholak, R. Soare), definability issues in the c.e. and Turing degrees (A. Nies, R. Shore) and other degree structures (M. Arslanov, S. Badaev and S. Goncharov, P. Odifreddi, A. Sorbi). The topics involving relations between computability and other areas of logic and mathematics are reverse mathematics and proof theory (D. Cenzer and C. Jockusch, C. Chong and Y. Yang, H. Friedman and S. Simpson), set theory (R. Dougherty and A. Kechris, M. Groszek, T. Slaman) and computable mathematics and model theory (K. Ambos-Spies and A. Kucera, R. Downey and J. Remmel, S. Goncharov and B. Khoussainov, J. Knight, M. Peretyat'kin, A. Shlapentokh).

Product Specifications

Format: paperback
ASIN: 0821819224
Category: Books > Subjects > Science, Nature & Maths > Mathematics > Mathematical Foundations > Mathematical Logic
Domain: Amazon UK
Release Date: 17 August 2000
Listed Since: 17 December 2006

Barcode

No barcode data available

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

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

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

The Foundations of Computability Theory

Constructive Models (Siberian School of Algebra and Logic)

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

Algebraic Methods in Statistics and Probability II (Contemporary Mathematics): Ams Special Session Algebraic Methods in Statistics and Probability, ... Illinois at Urbana-champaign, Champaign, Il

Language Computability and Formal Language Theory

Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexity

Springer - Reverse Mathematics: Problems, Reductions, and Proofs

Computational Group Theory and the Theory of Groups II (Contemporary Mathematics): Computational Group Theory and Cohomology, August 4-8, 2008, ... Western Michigan University, Kalamazoo, Mi

Computability Theory: An Introduction to Recursion Theory

Springer Computational Invariant Theory: 130 Mathematics Book

Algorithmic Combinatorics: Enumerative Combinatorics, Special Functions and Computer Algebra: In Honour of Peter Paule on his 60th Birthday (Texts & Monographs in Symbolic Computation)

Theory of Computation: Automata, Formal Languages, Computation and Complexity

Algorithmic Probability and Combinatorics (Contemporary Mathematics): Ams Special Sessions on Algorithmic Probability and Combinatorics, October 5-6, ... of British Columbia, Vancouver, Bc, Canada

Special Topics in Mathematics for Computer Scientists: Sets, Categories, Topologies and Measures

Apartness and Uniformity: A Constructive Development (Theory and Applications of Computability)

Advances in Unconventional Computing: Volume 1: Theory: 22 (Emergence, Complexity and Computation, 22)

Non-Commutative Cryptography and Complexity of Group-Theoretic Problems (Mathematical Surveys and Monographs)

The Incomputable: Journeys Beyond the Turing Barrier (Theory and Applications of Computability)

Combinatorics of Nonnegative Matrices (Translations of Mathematical Monographs)

Combinatorial Set Theory: With a Gentle Introduction to Forcing (Springer Monographs in Mathematics)

Computation Engineering: Applied Automata Theory and Logic

Mathematical Techniques for Analyzing Concurrent and Probabilistic Systems (CRM Monograph Series)

Proof And Computation II: From Proof Theory And Univalent Mathematics To Program Extraction And Verification