This is a book about computation, something which is ubiquitous in the modern world. More precisely, it examines computability theory and computational complexity theory. Computability theory is the part of mathematics and computer science which s...Lasīt vairāk
(Izdošanas datums: 09-Apr-2024, Hardback, Izdevniecība: World Scientific Publishing Co Pte Ltd, ISBN-13: 9789811232275)
This is a book about the Halting Problem, arguably the most (in)famous computer-related problem: can an algorithm decide in finite time whether an arbitrary computer program eventually stops? This seems a dull, petty question: after all, you run t...Lasīt vairāk
This survey of computability theory offers the techniques and tools that computer scientists (as well as mathematicians and philosophers studying the mathematical foundations of computing) need to mathematically analyze computational processes and...Lasīt vairāk
Reverse mathematics studies the complexity of proving mathematical theorems and solving mathematical problems. Typical questions include: Can we prove this result without first proving that one? Can a computer solve this problem? A highly active p...Lasīt vairāk
This survey of computability theory offers the techniques and tools that computer scientists (as well as mathematicians and philosophers studying the mathematical foundations of computing) need to mathematically analyze computational processes and...Lasīt vairāk
Reverse mathematics studies the complexity of proving mathematical theorems and solving mathematical problems. Typical questions include: Can we prove this result without first proving that one? Can a computer solve this problem? A highly active p...Lasīt vairāk
(Izdošanas datums: 28-Jun-2022, Hardback, Izdevniecība: World Scientific Publishing Co Pte Ltd, ISBN-13: 9789811259289)
This Volume Features The Latest Scientific Developments In The Fields Of Computability Theory And Logical Foundations Of Mathematics As Well As Applications. The Scope Involves The Topics Of Computability Theory, Reverse Mathematics, Nonstandard A...Lasīt vairāk
Computable analysis is the modern theory of computability and complexity in analysis that arose out of Turings seminal work in the 1930s. This was motivated by questions such as: which real numbers and real number functions are computable, and wh...Lasīt vairāk
This is the ?rst book to systematically introduce the basic constructive-computational theory and methods developed for investigating solvable polynomial algebras and their modules. This book is perfectly suited to researchers and postgrads resear...Lasīt vairāk
(Izdošanas datums: 24-Jun-2021, Hardback, Izdevniecība: Cambridge University Press, ISBN-13: 9781108423298)
In mathematics, we know there are some concepts - objects, constructions, structures, proofs - that are more complex and difficult to describe than others. Computable structure theory quantifies and studies the complexity of mathematical structures,...Lasīt vairāk
This handbook is the first coherent presentation of a cross-section through most active research topics on the more theoretical side of the field. All chapters are written by leading experts who are working at the cutting edge of the respective to...Lasīt vairāk
This book, Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexity, presents new techniques with functorial models to address important areas on pure mathematics and computability theory from th...Lasīt vairāk
Considering how minimal weak truth table degrees interact with computably enumerable Turing degrees, Downey, Ng, and Solomon obtain three main results. First, there are sets with minimal weak truth table degree that bound noncomputable computably...Lasīt vairāk
Douglas Cenzer, Christopher Porter, Jindrich Zapletal
(Izdošanas datums: 19-Oct-2020, Hardback, Izdevniecība: World Scientific Publishing Co Pte Ltd, ISBN-13: 9789813228221)
This volume presents some exciting new developments occurring on the interface between set theory and computability as well as their applications in algebra, analysis and topology. These include effective versions of Borel equivalence, Borel reduc...Lasīt vairāk
(Izdošanas datums: 16-Jun-2020, Hardback, Izdevniecība: Princeton University Press, ISBN-13: 9780691199658)
This book presents new results in computability theory, a branch of mathematical logic and computer science that has become increasingly relevant in recent years. The fields connections with disparate areas of mathematical logic and mathematics mor...Lasīt vairāk
Computability theory is a branch of mathematical logic and computer science that has become increasingly relevant in recent years. The field has developed growing connections in diverse areas of mathematics, with applications suitable to topology,...Lasīt vairāk
Category theory is unmatched in its ability to organize and layer abstractions and to find commonalities between structures of all sorts. No longer the exclusive preserve of pure mathematicians, it is now proving itself to be a powerful tool in scien...Lasīt vairāk
(Izdošanas datums: 18-Jul-2019, Hardback, Izdevniecība: Cambridge University Press, ISBN-13: 9781108482295)
Category theory is unmatched in its ability to organize and layer abstractions and to find commonalities between structures of all sorts. No longer the exclusive preserve of pure mathematicians, it is now proving itself to be a powerful tool in scien...Lasīt vairāk
