Computability, complexity, and languages

Name: Computability, complexity, and languages
ISBN: 9780122063824

Davis, Martin · 1983

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.

Computer Science

Open Library Amazon

Stats for nerds

1recommend

2mentions

2people

2011–2016years

50% recommend50% neutral

Mentions per year

What Hacker News says

geekamMay 2011
"Introduction to Algorithms" (http://www.amazon.com/Introduction-Algorithms-Second-Thomas-...)
"The Art of Computer Programming" (http://www.amazon.com/s/ref=nb_sb_ss_i_6_31?url=search-alias...)
....to begin with.
Then there are theoretical computer science books.
I like the Computability, Complexity, and Languages, Second Edition: Fundamentals of Theoretical Computer Science (Computer Science and Scientific Computing)
http://www.amazon.com/Computability-Complexity-Languages-Sec...
thread
ramadisJul 2016
The S language is a theoretical programming language proposed by Martin Davids in his book Computability, Complexity and Languages. It is composed by labels, variables, and 4 basic instructions, and its used between many things, to prove that there are natural functions (F: N^n -> N) which can not be computed. Awesome!
If you want to see the repo, you can find it in https://github.com/ramadis/slang
thread