Isbn: 9781108792745 - theoretical computer science for the working category theorist (26 risultati)

Condizione: New.

Condizione: New.

Paperback. Condizione: New. 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.…

Paperback. Condizione: new. Paperback. 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 Goedel's incompleteness theorem, intractable problems, cryptographic protocols, Alan Turing's Halting problem, and much more. The concepts come alive with many examples and exercises. This Element presents the usual material taught in a yearlong course of theoretical computer science using the intuitive language and methodology of category theory. Perfect for students or professionals working in computers or physics, or mathematics. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.…

PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.

Condizione: New. In English.

Paperback. Condizione: Brand New. 75 pages. 9.00x6.00x0.32 inches. In Stock.

Condizione: New. 2022. New. Paperback. . . . . .

Paperback. Condizione: New.

PF. Condizione: New.

Condizione: New. New edition NO-PA16APR2015-KAP.

Condizione: New.

Paperback / softback. Condizione: New. New copy - Usually dispatched within 3 working days.

Condizione: New. 2022. New. Paperback. . . . . . Books ship from the US and Ireland.

Soft cover. Condizione: As New.

Condizione: As New. Unread book in perfect condition.

Condizione: As New. Unread book in perfect condition.

Taschenbuch. Condizione: Neu. Neuware - 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.…

Condizione: New. This Element presents the usual material taught in a yearlong course of theoretical computer science using the intuitive language and methodology of category theory. Perfect for students or professionals working in computers or physics, or mathematics.T.

Paperback. Condizione: new. Paperback. 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 Goedel's incompleteness theorem, intractable problems, cryptographic protocols, Alan Turing's Halting problem, and much more. The concepts come alive with many examples and exercises. This Element presents the usual material taught in a yearlong course of theoretical computer science using the intuitive language and methodology of category theory. Perfect for students or professionals working in computers or physics, or mathematics. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.…

Taschenbuch. Condizione: Neu. Theoretical Computer Science for the Working Category Theorist | Noson S. Yanofsky | Taschenbuch | Elements in Applied Category Theory | Kartoniert / Broschiert | Englisch | 2022 | Cambridge University Press | EAN 9781108792745 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu.…

Paperback. Condizione: New. 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.…

Taschenbuch. Condizione: Neu. Neuware -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. 148 pp. Englisch.…

Condizione: New. Print on Demand.

Condizione: New. PRINT ON DEMAND.

Paperback. Condizione: new. Paperback. 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 Goedel's incompleteness theorem, intractable problems, cryptographic protocols, Alan Turing's Halting problem, and much more. The concepts come alive with many examples and exercises. This Element presents the usual material taught in a yearlong course of theoretical computer science using the intuitive language and methodology of category theory. Perfect for students or professionals working in computers or physics, or mathematics. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.…