Algorithmic Randomness: Progress and Prospects

— —

Johanna N. Y. Franklin (Hofstra University, New York) Christopher P. Porter (Drake University, Iowa)

Algorithmic Randomness

Progress and Prospects

Johanna N. Y. Franklin (Hofstra University, New York), Christopher P. Porter (Drake University, Iowa)

$193.95

Hardback

Not in-store but you can order this
How long will it take?

Availability Information

We source books from suppliers in Australia and overseas. For books we don't currently have in stock, the time it takes to get them from our suppliers can vary widely - from a few days to a few months - so we check each book with each supplier to determine the expected time it will take to be supplied to us.

We then advise you accordingly. If the time taken to get any book is too long for you, you can let us know and we will cancel or adjust your order, and refund as required.

To find out the anticipated arrival time for specific items prior to ordering, please contact us by phone or email:

Phone +61 2 9264 3111, or 1800 4 BOOKS (1800 4 26657) if outside Sydney:
option 1 Abbey's Bookshop (Crime, History, Science, Kids & more) • info@abbeys.com.au
option 2 Language Book Centre (ESL & Foreign Languages) • language@abbeys.com.au
option 3 Galaxy Bookshop (Sci-fi, Fantasy, Romance, Graphic Novels) • sf@galaxybooks.com.au

QTY:

English

Cambridge University Press
07 May 2020

Mathematical logic; Probability & statistics; Algorithms & data structures; Databases

Series: Lecture Notes in Logic

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.

Edited by: Johanna N. Y. Franklin (Hofstra University New York), Christopher P. Porter (Drake University, Iowa)
Imprint: Cambridge University Press
Country of Publication: United Kingdom
Dimensions: Height: 234mm, Width: 157mm, Spine: 24mm
Weight: 640g
ISBN: 9781108478984
ISBN 10: 1108478980
Series: Lecture Notes in Logic
Pages: 368
Publication Date: 07 May 2020
Audience: Professional and scholarly , Undergraduate
Format: Hardback
Publisher's Status: Active

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.