storiet v.2

theme

voice

language

sign in
Cover of Computability, complexity, and languages

a novel ·

Computability, complexity, and languages

by

This introductory text covers the key areas of computer science, including recursive function theory, formal languages, and automata. It assumes very little background in formal mathematics. The book is divided into five parts: Computability, Grammars and Automata, Logic, Complexity, and …

start reading + shelf
  • ● 76% match for you

the long version

This introductory text covers the key areas of computer science, including recursive function theory, formal languages, and automata. It assumes very little background in formal mathematics. The book is divided into five parts: Computability, Grammars and Automata, Logic, Complexity, and Unsolvability.

M

Margaret's verdict

"This introductory text covers the key areas of computer science, including recursive function theory, formal languages, and automata. It assumes very little background in formal mathematics. The book is divided …"

— Margaret

highlights

what readers held onto

No highlights yet. Be the first.

discussion

what readers said

No reviews yet. Finish it; tell us what you found.