Andere Kunden interessierten sich auch für
![Natural Dualities for the Working Algebraist]( "Natural Dualities for the Working Algebraist")
Natural Dualities for the Working Algebraist207,99 €![The Representation Type of the I-Blocks of Category O_S]( "The Representation Type of the I-Blocks of Category O_S")
The Representation Type of the I-Blocks of Category O_S35,99 €![Matvei Petrovich Bronstein and Soviet Theoretical Physics in the Thirties]( "Matvei Petrovich Bronstein and Soviet Theoretical Physics in the Thirties")
Matvei Petrovich Bronstein and Soviet Theoretical Physics in the Thirties37,99 €![Basic concepts of Category Theory and its Applications]( "Basic concepts of Category Theory and its Applications")
Basic concepts of Category Theory and its Applications36,99 €![Category Theory, Homology Theory and Their Applications. Proceedings of the Conference Held at the Seattle Research of the Battelle Memorial Institute, June 24 - July 19, 1968]( "Category Theory, Homology Theory and Their Applications. Proceedings of the Conference Held at the Seattle Research of the Battelle Memorial Institute, June 24 - July 19, 1968")
Category Theory, Homology Theory and Their Applications. Proceedings of the Conference Held at the Seattle Research of the Battelle Memorial Institute, June 24 - July 19, 196842,99 €![Theoretical Fluid Dynamics]( "Theoretical Fluid Dynamics")
Theoretical Fluid Dynamics271,99 €![Formal Category Theory : Adjointness for 2-Categories]( "Formal Category Theory : Adjointness for 2-Categories")
Formal Category Theory : Adjointness for 2-Categories42,99 €
Using basic category theory, this Element describes all the central concepts and proves the main theorems of theoretical computer science. Category theory, which works with functions, processes, and structures, is uniquely qualified to present the fundamental results of theoretical computer science. In this Element, readers will meet some of the deepest ideas and theorems of modern computers and mathematics, such as Turing machines, unsolvable problems, the P=NP question, Kurt Gödel's incompleteness theorem, intractable problems, cryptographic protocols, Alan Turing's Halting problem, and much more. The concepts come alive with many examples and exercises.