We defined translations of a language in another and interpretations between theories. These notions allow us to state a more general version of the incompleteness results.
We then defined Turing machines.
We defined translations of a language in another and interpretations between theories. These notions allow us to state a more general version of the incompleteness results.
We then defined Turing machines.
This entry was posted on Thursday, February 21st, 2008 at 5:12 pm and is filed under 116b: Computability and incompleteness. You can follow any responses to this entry through the RSS 2.0 feed. You can leave a response, or trackback from your own site.