Computability Theory
0/82 solved1 / 82
Each question is graded on a single answer: a check that this chapter's methods work, not a test of the reasoning behind them.
A Turing machine is allowed to use:
comp-turing-1All Mathematical Logic chaptersEach question is graded on a single answer: a check that this chapter's methods work, not a test of the reasoning behind them.
comp-turing-1All Mathematical Logic chapters