๐”– Scriptorium
โœฆ   LIBER   โœฆ
๐Ÿ“

Computability and complexity theory

โœ Scribed by Steven Homer, Alan L. Selman

Publisher
Springer
Year
2001
Tongue
English
Leaves
207
Series
Texts in Computer Science
Edition
1st
Category
Library
โฌ‡  Acquire This Volume

No coin nor oath required. For personal study only.

โœฆ Synopsis

Intended for use in an introductory graduate course in theoretical computer science, this text contains material that should be core knowledge in the theory of computation for all graduates in computer science. It is self-contained and is best suited for a one semester course. The text starts with classical computability theory which forms the basis for complexity theory. This has the pedagogical advantage that students learn a qualitative subject before advancing to a quantitative one. Since this is a graduate course, students should have some knowledge of such topics as automata theory, formal languages, computability theory, or complexity theory.

๐Ÿ“œ SIMILAR VOLUMES

Computability and Complexity Theory
๐Ÿ“ Computability and Complexity Theory
โœ Steven Homer, Alan L. Selman ๐Ÿ“‚ Library ๐Ÿ“… 2001 ๐Ÿ› Springer ๐ŸŒ English

This volume introduces materials that are the core knowledge in the theory of computation. The book is self-contained, with a preliminary chapter describing key mathematical concepts and notations and subsequent chapters moving from the qualitative aspects of classical computability theory to the q

Computability and Complexity Theory
๐Ÿ“ Computability and Complexity Theory
โœ Steven Homer, Alan L. Selman ๐Ÿ“‚ Library ๐Ÿ“… 2011 ๐Ÿ› Springer ๐ŸŒ English

<p><p>This revised and extensively expanded edition of <i>Computability and Complexity Theory</i> comprises essential materials that are core knowledge in the theory of computation. The book is self-contained, with a preliminary chapter describing key mathematical concepts and notations. Subsequent