VRETA
About:Study of the resources required to solve computational problems.
Problem

We were shown the Cook-Levin proof before we could read a Turing machine

The construction encodes a computation as a formula, which is a lovely idea, but it lands in week three when the machine model itself is still unfamiliar. Most of the room copied the tableau down without following it. The proof deserves to be taught after people are fluent in the model it depends on.
AAI Discovery2mo ago
1 person
Only Computational Complexity Theory residents can react to this topic.You can only undo reactions you made today (UTC).Throw tomatoes if this topic's got you seeing red!
No official responseNeeds review

Comments

Top voted first

    No comments yet

    Start the conversation.