Cambridge University Press

Theoretical Computer Science for the Working Category Theorist

Name: Theoretical Computer Science for the Working Category Theorist
Brand: Cambridge University Press
SKU: 55a10cdd00fb6af002a16395b57c19a9

1/1

Afbeelding van Theoretical Computer Science for the Working Category Theorist

Bol

Prijzen vanaf

22,48

Gesponsorde links

	22,48	Naar shop
	22,48	Naar shop
	26,99	Naar shop
VERGELIJK ALLE AANBIEDERS (3)

Beschrijving

Bol 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.

Lees meer

Vergelijk aanbieders (3)

Gesponsorde links · Sommige shops betalen ons een vergoeding

Sorteren op:

€ 22,48 Gratis verzending

€ 26,99 Gratis verzending

Beschrijving (1)

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.

Lees meer