Computability and Randomness: 51 (Oxford Logic Guides) - Image 1

Price loading...

Oxford University Press Computability and Randomness: 51 (Oxford Logic Guides)

Name: Computability and Randomness: 51 (Oxford Logic Guides)
Brand: Oxford University Press

Computer Science

Price History & Forecast

No Price Data Available

Price history will appear here once data is collected from Amazon.

Price Distribution

No price data available for histogram

Description

The interplay between computability and randomness has been an active area of research in recent years, reflected by ample funding in the USA, numerous workshops, and publications on the subject. The complexity and the randomness aspect of a set of natural numbers are closely related. Traditionally, computability theory is concerned with the complexity aspect. However, computability theoretic tools can also be used to introduce mathematical counterparts for the intuitive notion of randomness of a set. Recent research shows that, conversely, concepts and methods originating from randomness enrich computability theory. The book covers topics such as lowness and highness properties, Kolmogorov complexity, betting strategies and higher computability. Both the basics and recent research results are desribed, providing a very readable introduction to the exciting interface of computability and randomness for graduates and researchers in computability theory, theoretical computer science, and measure theory.

Product Specifications

Brand: Oxford University Press
Format: paperback
ASIN: 0199652600
Category: Books > Subjects > Computing & Internet > Computer Science
Domain: Amazon UK
Publication Date: 29 March 2012
Listed Since: 21 September 2011

Barcode

No barcode data available

Oxford University Press Computability and Randomness: 51 (Oxford Logic Guides)

Price History & Forecast

No Price Data Available

Price Distribution

Description

Product Specifications

Barcode

Similar Products You Might Like

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

Randomness And Undecidability In Physics

Structure and Randomness in Computability and Set Theory

The Nature of Computation

Kolmogorov Complexity and Algorithmic Randomness - AMS Book

Kolmogorov Complexity and Algorithmic Randomness (Mathematical Surveys and Monographs)

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

Computational Complexity: A Conceptual Perspective

An Introduction to Kolmogorov Complexity and Its Applications (Texts in Computer Science)

Computability Theory: An Introduction to Recursion Theory

Computability: An Introduction to Recursive Function Theory

Probability and Randomness: Quantum Versus Classical

An Introduction to Random Sets

Information, Randomness And Incompleteness: Papers On Algorithmic Information Theory: 8 (World Scientific Series In Computer Science)

Information, Randomness & Incompleteness: Papers On Algorithmic Information Theory: 8 (World Scientific Series In Computer Science)

Computability and Complexity: Foundations and Tools for Pursuing Scientific Applications (Undergraduate Topics in Computer Science)

Algorithmic Randomness: Progress and Prospects: 50 (Lecture Notes in Logic, Series Number 50)

Handbook of Computability and Complexity in Analysis (Theory and Applications of Computability)

CRC Press - An Introduction to Random Sets - Mathematics Book

Probability and Computing: Randomization and Probabilistic Techniques in Algorithms and Data Analysis

Lower Bounds in Communication Complexity (Foundations and Trends (R) in Theoretical Computer Science)

Theoretical Computer Science: Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography

Aspects of Kolmogorov Complexity the Physics of Information (River Publishers Series in Information Science and Technology)

The Foundations of Computability Theory