Johanna N. Y. Franklin – författare
Visar alla böcker från författaren Johanna N. Y. Franklin. Handla med fri frakt och snabb leverans.
3 produkter
3 produkter
1 801 kr
Skickas inom 7-10 vardagar
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.
Del 13359 - Lecture Notes in Computer Science
Revolutions and Revelations in Computability
18th Conference on Computability in Europe, CiE 2022, Swansea, UK, July 11–15, 2022, Proceedings
Häftad, Engelska, 2022
705 kr
Skickas inom 10-15 vardagar
This book constitutes the proceedings of the 18th Conference on Computability in Europe, CiE 2022, in Swansea, UK, in July 2022. The 19 full papers together with 7 invited papers presented in this volume were carefully reviewed and selected from 41 submissions.
- Nyhet
1 619 kr
Skickas inom 10-15 vardagar
This monograph introduces the reader to the increasingly popular topic of computable metric structure theory, a subject which unifies methods from effective analysis and computable algebra into one coherent framework. Computable structure theory had been constrained to the algebraic and discrete realms, but in the past 10 years or so, much work has been done in extending this topic to structures from analysis such as metric spaces, Banach spaces, and operator algebras. This book is the first comprehensive treatment of these basic results and discusses several challenging open problems that have arisen. The book provides a foundation for the study of classic objects from functional analysis using tools from continuous model theory and computable structure theory. It is largely self contained, though it is assumed that the reader is familiar with first-order logic. It should prove useful to students and researchers in continuous logic looking to familiarize themselves with computable structure theory as well as to researchers in the latter field looking to extend their work to structures from analysis. The discussion contains a large number of well-crafted examples and could provide the basis for a course or seminar in this area.