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

£97.00

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

Name: Algorithmic Randomness: Progress and Prospects: 50 (Lecture Notes in Logic, Series Number 50)
Brand: Cambridge University Press
Price: 97.0 GBP
Availability: InStock

Databases

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

£97 today · previous high £97 · all-time low £92

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

Historical

Generating forecast...

Price Distribution

Price distribution over 639 days • 5 price levels

Days at Price

Current Price

Price Analysis

Most common price: £95 (311 days, 48.7%)

Price range: £92 - £97

Price levels: 5 different prices over 639 days

Description

The last two decades have seen a wave of exciting new developments in the theory of algorithmic randomness and its applications to other areas of mathematics. This volume surveys much of the recent work that has not been included in published volumes until now. It contains a range of articles on algorithmic randomness and its interactions with closely related topics such as computability theory and computational complexity, as well as wider applications in areas of mathematics including analysis, probability, and ergodic theory. In addition to being an indispensable reference for researchers in algorithmic randomness, the unified view of the theory presented here makes this an excellent entry point for graduate students and other newcomers to the field. Book Description Surveys on recent developments in the theory of algorithmic randomness and its interactions with other areas of mathematics. About the Author Johanna N. Y. Franklin is an Associate Professor at Hofstra University in Hempstead, NY. She earned her Ph.D. from the Group in Logic and the Methodology of Science at the University of California, Berkeley and has held postdoctoral positions in Singapore, Canada, and the United States.Christopher P. Porter is an Assistant Professor of Mathematics at Drake University in Des Moines, IA. After receiving his Ph.D. in the joint program in mathematics and philosophy at the University of Notre Dame, Porter completed postdoctoral positions at the University of Paris 7 and the University of Florida.

Product Specifications

Brand: Cambridge University Press
Format: hardcover
ASIN: 1108478980
Category: Books > Subjects > Computing & Internet > Databases
Domain: Amazon UK
Release Date: 07 May 2020
Listed Since: 26 February 2020

Barcode

No barcode data available

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

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

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

Computability and Randomness: 51 (Oxford Logic Guides)

Methods in Algorithmic Analysis (Chapman & Hall/CRC Computer and Information Science Series)

Randomness And Undecidability In Physics

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

The Probabilistic Method, 4th Edition

The Discrete Mathematical Charms of Paul Erdos: A Simple Introduction

Structure and Randomness in Computability and Set Theory

Probability Logics: Probability-Based Formalization of Uncertain Reasoning

Semitopological Vector Spaces: Hypernorms, Hyperseminorms, and Operators

The Nature of Computation

Stochastic Coalgebraic Logic (Monographs in Theoretical Computer Science. An EATCS Series)

Free Probability and Random Matrices: 35 (Fields Institute Monographs, 35)

Introduction to Random Processes in Engineering

Logics for Computer and Data Sciences, and Artificial Intelligence: 992 (Studies in Computational Intelligence, 992)

Samson Abramsky on Logic and Structure in Computer Science and Beyond: 25 (Outstanding Contributions to Logic, 25)

Free Probability and Random Matrices: 35 (Fields Institute Monographs, 35)

Free Probability Theory (Fields Institute Communications)

Stochastic Relations: Foundations for Markov Transition Systems (Chapman & Hall/CRC Studies in Informatics Series)

Random Number Generators-Principles and Practices: A Guide for Engineers and Programmers

Philosophical Logic: Current Trends in Asia: Proceedings of AWPL-TPLC 2016 (Logic in Asia: Studia Logica Library)

Introduction to Random Processes in Engineering

Discrete Encounters: A New Approach (Chapman & Hall/CRC Cryptography and Network Security Series)

Boole's Logic and Probability: A Critical Exposition from the Standpoint of Contemporary Algebra, Logic and Probability Theory