Obálkyknih.cz - Jihočeská vědecká knihovna v Českých Budějovicích

oprava existující anotace, přidání nové anotace

Název:		Computability, complexity, and languages : fundamentals of theoretical computer science
Autor:		Davis, Martin
Rok vydání:		1983.
Identifikátory:		9780122063800

Upravte stávající anotaci nebo vložte anotaci novou.
Anotace:	This introductory text covers the key areas of computer science, including recursive function theory, formal languages, and automata. It assumes a minimal background in formal mathematics. The book is divided into five parts: Computability, Grammars and Automata, Logic, Complexity, and Unsolvability. * Computability theory is introduced in a manner that makes maximum use of previous programming experience, including a "universal" program that takes up less than a page.* The number of exercises included has more than tripled.* Automata theory, computational logic, and complexity theory are presented in a flexible manner, and can be covered in a variety of different arrangements.
	Souhlasím s využitím anotace pro potřeby projektu obálkyknih.cz. Obsah neporušuje autorská práva.(povinné)