Is there a good mathematically rigorous introduction to computability theory based on Turing machines? I have looked at some CS books but found them quite unsatisfying for a mathematician (too wordy in the chatty parts, too vague when it comes to details, along the lines of "existence of a universal machine: why, isn't that clear?"). I am (I would hope) "mathematically mature" and I know some basic recursion theory.
Asked
Active
Viewed 511 times
8
-
Seems like a good candidate to merge with this question – rschwieb Mar 14 '19 at 12:50