(Ilmumisaeg: 20-Aug-2025, Hardback, Kirjastus: Springer International Publishing AG, ISBN-13: 9783031924323)
This is the first book which gives a unified theory for countable and uncountable computable structures.The work treats computable linear orderings, graphs, groups and Boolean algebras unified with computable metric and Banach spaces, profi...Loe edasi...
(Ilmumisaeg: 15-Mar-2025, Hardback, Kirjastus: Springer International Publishing AG, ISBN-13: 9783031787003)
The subject of this monograph are restarting automata. The definition of these automata is motivated by the linguistic technique of analysis by reduction. This technique, which can be used to analyze sentences in natural languages with a rather fr...Loe edasi...
(Ilmumisaeg: 30-Oct-2024, Hardback, Kirjastus: Springer International Publishing AG, ISBN-13: 9783031700934)
The subject of this monograph are restarting automata. The definition of these automata is motivated by the linguistic technique of analysis by reduction. This technique, which can be used to analyze sentences in natural languages with a rather fr...Loe edasi...
It is not always clear what computer programs mean in the various languages in which they can be written, yet a picture can be worth 1000 words, a diagram 1000 instructions.In this unique textbook/reference, programs are drawn as string dia...Loe edasi...
(Ilmumisaeg: 20-Sep-2023, Hardback, Kirjastus: Springer International Publishing AG, ISBN-13: 9783031348266)
It is not always clear what computer programs mean in the various languages in which they can be written, yet a picture can be worth 1000 words, a diagram 1000 instructions.In this unique textbook/reference, programs are drawn as string dia...Loe edasi...
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...Loe edasi...
(Ilmumisaeg: 26-Jul-2022, Hardback, Kirjastus: Springer International Publishing AG, ISBN-13: 9783031113666)
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...Loe edasi...
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...Loe edasi...
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...Loe edasi...
This book questions the relevance of computation to the physical universe. Our theories deliver computational descriptions, but the gaps and discontinuities in our grasp suggest a need for continued discourse between researchers from different dis...Loe edasi...
(Ilmumisaeg: 07-Jun-2018, Paperback / softback, Kirjastus: Springer-Verlag Berlin and Heidelberg GmbH & Co. K, ISBN-13: 9783662568583)
This book emphasizes three very important concepts: computability, as opposed to recursion or induction; classical computability; and the art of computability, a skill to be practiced but also important in an esthetic sense of beauty and taste in mat...Loe edasi...
(Ilmumisaeg: 12-May-2017, Hardback, Kirjastus: Springer International Publishing AG, ISBN-13: 9783319436678)
This book questions the relevance of computation to the physical universe. Our theories deliver computational descriptions, but the gaps and discontinuities in our grasp suggest a need for continued discourse between researchers from different discip...Loe edasi...
(Ilmumisaeg: 28-Jun-2016, Hardback, Kirjastus: Springer-Verlag Berlin and Heidelberg GmbH & Co. K, ISBN-13: 9783642319327)
This book emphasizes three very important concepts: computability, as opposed to recursion or induction; classical computability, i.e., algorithmic functions on certain countable structures in the original sense of Turing and Post; and the art of com...Loe edasi...
(Ilmumisaeg: 17-Nov-2015, Hardback, Kirjastus: Springer-Verlag Berlin and Heidelberg GmbH & Co. K, ISBN-13: 9783662479919)
This book offers a self-contained exposition of the theory of computability in a higher-order context, where computable operations may themselves be passed as arguments to other computable operations. The subject originated in the 1950s with the wo...Loe edasi...
(Ilmumisaeg: 23-Aug-2016, Paperback / softback, Kirjastus: Springer-Verlag New York Inc., ISBN-13: 9781493938209)
Exploring the theory of computability and complexity over the real numbers, this book provides a systematic, technical development of algorithmic randomness and complexity for scientists working in diverse fields concerned with theoretical compu...Loe edasi...
(Ilmumisaeg: 23-Aug-2016, Paperback / softback, Kirjastus: Springer-Verlag Berlin and Heidelberg GmbH & Co. K, ISBN-13: 9783662517116)
This book offers a self-contained exposition of the theory of computability in a higher-order context, where computable operations may themselves be passed as arguments to other computable operations. This book offers a self-contained ex...Loe edasi...
(Ilmumisaeg: 27-Nov-2013, Paperback / softback, Kirjastus: Springer-Verlag Berlin and Heidelberg GmbH & Co. K, ISBN-13: 9783642269967)
This book presents a theory of apartness encompassing both point-set topology and the theory of uniform spaces. The first book on the apartness approach to constructive topology, it is a valuable addition to the literature on topology in computer sci...Loe edasi...
(Ilmumisaeg: 10-Sep-2011, Hardback, Kirjastus: Springer-Verlag Berlin and Heidelberg GmbH & Co. K, ISBN-13: 9783642224140)
The theory of apartness that the authors present in this book encompasses both point-set topology and the theory of uniform spaces. In the first chapter the authors introduce informal constructive (intuitionistic) logic and set theory, and, briefl...Loe edasi...
(Ilmumisaeg: 05-Nov-2010, Hardback, Kirjastus: Springer-Verlag New York Inc., ISBN-13: 9780387955674)
Computability and complexity theory are two central areas of research in theoretical computer science. This book provides a systematic, technical development of algorithmic randomness and complexity for scientists from diverse fields....Loe edasi...
