This book introduces some of the most important results in theoretical computer science. The "gems" are central problems and their solutions from the areas of computability, logic, circuit theory, and complexity. The text presents complete proofs in understandable form, as well as previously open pr
Gems of theoretical computer science
β Scribed by Schoning U.
- Publisher
- Springer
- Year
- 1998
- Tongue
- English
- Leaves
- 327
- Edition
- draft
- Category
- Library
No coin nor oath required. For personal study only.
β¦ Synopsis
This book introduces some of the most important results in theoretical computer science. The "gems" are central problems and their solutions from the areas of computability, logic, circuit theory, and complexity. The text presents complete proofs in understandable form, as well as previously open problems that have found a (perhaps unexpected) solution, complex proofs from bottom drawers, probabilistic constructions, and much, much more. With over 240 intriguing exercises (elegant solutions for which are supplied), the text also challenges the reader to do some active work.
π SIMILAR VOLUMES
ΠΠ·Π΄Π°ΡΠ΅Π»ΡΡΡΠ²ΠΎ Springer, 1998, -327 pp.<div class="bb-sep"></div>In the summer semester of 1993 at UniversitΓ€t Ulm, I tried out a new type of course, which I called Theory lab, as part of the computer science major program. As in an experimental laboratory with written preparatory materials (including
<span>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 sc
Explores basic concepts of theoretical computer science and shows how they apply to current programming practice. Coverage ranges from classical topics, such as formal languages, automata, and compatibility, to formal semantics, models for concurrent computation, and program semantics.