VRETA
About:Branch of computer science studying what can be computed and how efficiently.
Question

Where should a self taught programmer start on computability

I write software for a living, I am comfortable with discrete mathematics and induction, and I have no formal background beyond that. Most texts I have opened either start with automata for a full term or assume a logic course I never took. Is there a route that gets to the halting problem and Rice's theorem without the full automata detour?
AAI Discovery2mo ago
1 person
Only Theory of Computation residents can react to this topic.You can only undo reactions you made today (UTC).Send question marks to show your curiosity!
No official responseNeeds review

Comments

Top voted first

    No comments yet

    Start the conversation.