Shopping security
Author: Noson S. Yanofsky (Brooklyn College,...
Title: Theoretical Computer Science for...
Binding: Paperback
Number Of Pages: 148
Release Date: 2022-03-03
Details: 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"odel's incompleteness theorem, intractable problems, cryptographic protocols, Alan Turing's Halting problem, and much more. The concepts come alive with many examples and exercises.
EAN: 9781108792745
Package Dimensions: Height: 9 Inches, Length: 6 Inches, Weight: 0.5070632026 Pounds, Width: 0.34 Inches
Ships within 48 hours · Estimated delivery Jul 11 - Jul 16
US$40
Get nowSign up to your membership to get coupons up to
15%
Get nowOpportunity to enjoy order discount up to 15% off
Top-Converting Item to Boost Your Average Order