Computational Prospects of Infinity

Computational Prospects of Infinity

Author: Chitat Chong

Publisher: World Scientific

Published: 2008

Total Pages: 431

ISBN-13: 981279655X

DOWNLOAD EBOOK

This volume is a collection of written versions of the talks given at the Workshop on Computational Prospects of Infinity, held at the Institute for Mathematical Sciences from 18 June to 15 August 2005. It consists of contributions from many of the leading experts in recursion theory (computability theory) and set theory. Topics covered include the structure theory of various notions of degrees of unsolvability, algorithmic randomness, reverse mathematics, forcing, large cardinals and inner model theory, and many others.


Computational Prospects of Infinity - Part I

Computational Prospects of Infinity - Part I

Author: Chi-Tat Chong

Publisher: World Scientific

Published: 2008

Total Pages: 264

ISBN-13: 9812794050

DOWNLOAD EBOOK

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.


Computational Prospects Of Infinity - Part I: Tutorials

Computational Prospects Of Infinity - Part I: Tutorials

Author: Chi Tat Chong

Publisher: World Scientific

Published: 2008-05-02

Total Pages: 264

ISBN-13: 9814471593

DOWNLOAD EBOOK

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.


Computational Prospects Of Infinity - Part Ii: Presented Talks

Computational Prospects Of Infinity - Part Ii: Presented Talks

Author: Chi Tat Chong

Publisher: World Scientific

Published: 2008-06-02

Total Pages: 431

ISBN-13: 9814471526

DOWNLOAD EBOOK

This volume is a collection of written versions of the talks given at the Workshop on Computational Prospects of Infinity, held at the Institute for Mathematical Sciences from 18 June to 15 August 2005. It consists of contributions from many of the leading experts in recursion theory (computability theory) and set theory. Topics covered include the structure theory of various notions of degrees of unsolvability, algorithmic randomness, reverse mathematics, forcing, large cardinals and inner model theory, and many others.


Foundations of Mathematics

Foundations of Mathematics

Author: Andrés Eduardo Caicedo

Publisher: American Mathematical Soc.

Published: 2017-05-12

Total Pages: 346

ISBN-13: 1470422565

DOWNLOAD EBOOK

This volume contains the proceedings of the Logic at Harvard conference in honor of W. Hugh Woodin's 60th birthday, held March 27–29, 2015, at Harvard University. It presents a collection of papers related to the work of Woodin, who has been one of the leading figures in set theory since the early 1980s. The topics cover many of the areas central to Woodin's work, including large cardinals, determinacy, descriptive set theory and the continuum problem, as well as connections between set theory and Banach spaces, recursion theory, and philosophy, each reflecting a period of Woodin's career. Other topics covered are forcing axioms, inner model theory, the partition calculus, and the theory of ultrafilters. This volume should make a suitable introduction to Woodin's work and the concerns which motivate it. The papers should be of interest to graduate students and researchers in both mathematics and philosophy of mathematics, particularly in set theory, foundations and related areas.


Unity of Logic and Computation

Unity of Logic and Computation

Author: Gianluca Della Vedova

Publisher: Springer Nature

Published: 2023-07-18

Total Pages: 327

ISBN-13: 3031369785

DOWNLOAD EBOOK

This book constitutes the refereed proceedings of the 19th International Conference on Unity of Logic and Computation, CiE 2023, held in Batumi, Georgia, during July 24–28, 2023. The 23 full papers and 13 invited papers included in this book were carefully reviewed and selected from 51 submissions. They were organized in topical sections as follows: ​Degree theory; Proof Theory; Computability; Algorithmic Randomness; Computational Complexity; Interactive proofs; and Combinatorial approaches.


Aspects Of Computation And Automata Theory With Applications

Aspects Of Computation And Automata Theory With Applications

Author: Noam Greenberg

Publisher: World Scientific

Published: 2023-10-23

Total Pages: 492

ISBN-13: 9811278644

DOWNLOAD EBOOK

This volume results from two programs that took place at the Institute for Mathematical Sciences at the National University of Singapore: Aspects of Computation — in Celebration of the Research Work of Professor Rod Downey (21 August to 15 September 2017) and Automata Theory and Applications: Games, Learning and Structures (20-24 September 2021).The first program was dedicated to the research work of Rodney G. Downey, in celebration of his 60th birthday. The second program covered automata theory whereby researchers investigate the other end of computation, namely the computation with finite automata, and the intermediate level of languages in the Chomsky hierarchy (like context-free and context-sensitive languages).This volume contains 17 contributions reflecting the current state-of-art in the fields of the two programs.


Computing with Foresight and Industry

Computing with Foresight and Industry

Author: Florin Manea

Publisher: Springer

Published: 2019-07-04

Total Pages: 336

ISBN-13: 3030229963

DOWNLOAD EBOOK

This book constitutes the refereed proceedings of the 15th Conference on Computability in Europe, CiE 2019, held in Durham, UK, in July 2019. The 20 revised full papers presented were carefully reviewed and selected from 35 submissions. In addition, this volume includes 7 invited papers. The conference CiE 2018 had the following six special sessions: computational neuroscience, history and philosophy of computing, lowness notions in computability, probabilistic programming and higher-order computation, smoothed and probabilistic analysis of algorithms, and transnite computations.


Recursion Theory

Recursion Theory

Author: Chi Tat Chong

Publisher: Walter de Gruyter GmbH & Co KG

Published: 2015-08-17

Total Pages: 409

ISBN-13: 311038129X

DOWNLOAD EBOOK

This monograph presents recursion theory from a generalized point of view centered on the computational aspects of definability. A major theme is the study of the structures of degrees arising from two key notions of reducibility, the Turing degrees and the hyperdegrees, using techniques and ideas from recursion theory, hyperarithmetic theory, and descriptive set theory. The emphasis is on the interplay between recursion theory and set theory, anchored on the notion of definability. The monograph covers a number of fundamental results in hyperarithmetic theory as well as some recent results on the structure theory of Turing and hyperdegrees. It also features a chapter on the applications of these investigations to higher randomness.


Braids

Braids

Author: A. Jon Berrick

Publisher: World Scientific

Published: 2010

Total Pages: 414

ISBN-13: 9814291404

DOWNLOAD EBOOK

This book is an indispensable guide for anyone seeking to familarize themselves with research in braid groups, configuration spaces and their applications. Starting at the beginning, and assuming only basic topology and group theory, the volume's noted expositors take the reader through the fundamental theory and on to current research and applications in fields as varied as astrophysics, cryptography and robotics. As leading researchers themselves, the authors write enthusiastically about their topics, and include many striking illustrations. The chapters have their origins in tutorials given at a Summer School on Braids, at the National University of Singapore's Institute for Mathematical Sciences in June 2007, to an audience of more than thirty international graduate students.