Back to the big questions
A function is computable if a TM can, given the input, end with the output written on the tape.
Two types of computability:
Hilbert’s 10th problem
- Given any polynomial in n variables, give an algorithm that says whether the polynomial has at least one integer root.