Theory and Applications of Computability – serie
Visar alla böcker i serien Theory and Applications of Computability. Handla med fri frakt och snabb leverans.
22 produkter
Algorithmic Randomness and Complexity
Av Rodney G. Downey, Denis R. Hirschfeldt
Inbunden, 2010
1692 kr
Lägg i varukorg
Intuitively, a sequence such as 101010101010101010… does not seem random, whereas 101101011101010100…, obtained using coin tosses, does. How can we reconcile this intuition with the fact that both are statistically equally likely? What does it mean to say that an individual mathematical object such …
Algorithmic Randomness and Complexity
Av Rodney G. Downey, Denis R. Hirschfeldt
Häftad, 2016
1243 kr
Lägg i varukorg
Intuitively, a sequence such as 101010101010101010… does not seem random, whereas 101101011101010100…, obtained using coin tosses, does. How can we reconcile this intuition with the fact that both are statistically equally likely? What does it mean to say that an individual mathematical object such …
Handbook of Computability and Complexity in Analysis
Av Vasco Brattka, Peter Hertling
Inbunden, 2021
1098 kr
Lägg i varukorg
Computable analysis is the modern theory of computability and complexity in analysis that arose out of Turing's seminal work in the 1930s. This was motivated by questions such as: which real numbers and real number functions are computable, and which mathematical tasks in analysis can be solved by …
Handbook of Computability and Complexity in Analysis
Av Vasco Brattka, Peter Hertling
Häftad, 2022
769 kr
Lägg i varukorg
Computable analysis is the modern theory of computability and complexity in analysis that arose out of Turing's seminal work in the 1930s. This was motivated by questions such as: which real numbers and real number functions are computable, and which mathematical tasks in analysis can be solved by …
Reverse Mathematics
Problems, Reductions, and Proofs
Av Damir D. Dzhafarov, Carl Mummert
Inbunden, 2022
667 kr
Lägg i varukorg
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 part of mathematical logic and computability theory, …
Reverse Mathematics
Problems, Reductions, and Proofs
Av Damir D. Dzhafarov, Carl Mummert
Häftad, 2023
461 kr
Lägg i varukorg
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 part of mathematical logic and computability theory, …
Programs as Diagrams
From Categorical Computability to Computable Categories
Inbunden, 2023
989 kr
Lägg i varukorg
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 diagrams in the language of categories, which display a …
Programs as Diagrams
From Categorical Computability to Computable Categories
Häftad, 2024
716 kr
Lägg i varukorg
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 diagrams in the language of categories, which display a …
Restarting Automata
The Standard Type of Restarting Automaton and Its Variants
Inbunden, 2024
2253 kr
Lägg i varukorg
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 free word-order like Czech (or Latin or German), …
Restarting Automata
The Standard Type of Restarting Automaton and Its Variants
Häftad, 2025
2253 kr
Lägg i varukorg
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 free word-order like Czech (or Latin or German), …
Restarting Automata
Extensions and Generalizations
Inbunden, 2025
2253 kr
Lägg i varukorg
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 free word-order like Czech (or Latin or German), …
Restarting Automata
Extensions and Generalizations
Häftad, 2026
2253 kr
Lägg i varukorg
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 free word-order like Czech (or Latin or German), …
Computable Structure Theory
A Unified Approach
Av Rodney G. Downey, Alexander Melnikov
Inbunden, 2025
1425 kr
Lägg i varukorg
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, profinite groups, and the like. Further, it provides the first …
Choquet Capacities and Fuzzy Integrals
Av Gleb Beliakov, Simon James m. fl.
Inbunden, 2025
873 kr
Lägg i varukorg
Choquet capacities, which provide the weighting mechanism for the Choquet and other fuzzy integrals, model synergistic and antagonistic interactions between variables by assigning value to all subsets rather than individual inputs. While the flexibility of capacities (also referred to as fuzzy …
Incomputable
Journeys Beyond the Turing Barrier
Av S. Barry Cooper, Mariya I. Soskova
Inbunden, 2017
1425 kr
Lägg i varukorg
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 disciplines, and this book is unique in its focus on …
Incomputable
Journeys Beyond the Turing Barrier
Av S. Barry Cooper, Mariya I. Soskova
Häftad, 2018
1425 kr
Lägg i varukorg
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 disciplines, and this book is unique in its focus on …
Apartness and Uniformity
A Constructive Development
Av Douglas S. Bridges, Luminiţa Simona Vîţă
Inbunden, 2011
1098 kr
Lägg i varukorg
The theory presented in this book is developed constructively, is based on a few axioms encapsulating the notion of objects (points and sets) being apart, and encompasses both point-set topology and the theory of uniform spaces. While the classical-logic-based theory of proximity spaces provides …
Apartness and Uniformity
A Constructive Development
Av Douglas S. Bridges, Luminiţa Simona Vîţă
Häftad, 2013
1098 kr
Lägg i varukorg
The theory presented in this book is developed constructively, is based on a few axioms encapsulating the notion of objects (points and sets) being apart, and encompasses both point-set topology and the theory of uniform spaces. While the classical-logic-based theory of proximity spaces provides …
Turing Computability
Theory and Applications
Inbunden, 2016
934 kr
Lägg i varukorg
Turing's famous 1936 paper introduced a formal definition of a computing machine, a Turing machine. This model led to both the development of actual computers and to computability theory, the study of what machines can and cannot compute. This book presents classical computability theory from …
Higher-Order Computability
Inbunden, 2015
1804 kr
Lägg i varukorg
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 work of Kleene, Kreisel and others, and has since …
Higher-Order Computability
Häftad, 2016
1804 kr
Lägg i varukorg
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 work of Kleene, Kreisel and others, and has since …
Turing Computability
Theory and Applications
Häftad, 2018
660 kr
Lägg i varukorg
Turing's famous 1936 paper introduced a formal definition of a computing machine, a Turing machine. This model led to both the development of actual computers and to computability theory, the study of what machines can and cannot compute. This book presents classical computability theory from …
