We proved the Rice, Shapiro, McNaughton theorem characterizing index sets.
We also showed that there incomparable Turing degrees below .
We proved the Rice, Shapiro, McNaughton theorem characterizing index sets.
We also showed that there incomparable Turing degrees below .
This entry was posted on Tuesday, March 4th, 2008 at 2:29 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.