Reference for detailed exposition of Recursion/Computability Theory.
$begingroup$
I am looking for a reference that contains as much detail on recursion theory as possible. Many books that I am going through, such as Computability Theory by Barry Cooper and Recursively Enumerable Sets and Degrees by Robert Soare, avoid going into the rough details in proofs stating that they are often tedious. I am actually interested in finding the full proofs of things like the Kleene Normal Form Theorem, Enumeration Theorem, and S-M-N Theorems.
reference-request
asked Jan 16 at 18:08
SprinkleSprinkle
40629
$endgroup$
add a comment |
$begingroup$
I am looking for a reference that contains as much detail on recursion theory as possible. Many books that I am going through, such as Computability Theory by Barry Cooper and Recursively Enumerable Sets and Degrees by Robert Soare, avoid going into the rough details in proofs stating that they are often tedious. I am actually interested in finding the full proofs of things like the Kleene Normal Form Theorem, Enumeration Theorem, and S-M-N Theorems.
reference-request
asked Jan 16 at 18:08
SprinkleSprinkle
40629
$endgroup$
add a comment |
$begingroup$
I am looking for a reference that contains as much detail on recursion theory as possible. Many books that I am going through, such as Computability Theory by Barry Cooper and Recursively Enumerable Sets and Degrees by Robert Soare, avoid going into the rough details in proofs stating that they are often tedious. I am actually interested in finding the full proofs of things like the Kleene Normal Form Theorem, Enumeration Theorem, and S-M-N Theorems.
reference-request
asked Jan 16 at 18:08
SprinkleSprinkle
40629
$endgroup$
I am looking for a reference that contains as much detail on recursion theory as possible. Many books that I am going through, such as Computability Theory by Barry Cooper and Recursively Enumerable Sets and Degrees by Robert Soare, avoid going into the rough details in proofs stating that they are often tedious. I am actually interested in finding the full proofs of things like the Kleene Normal Form Theorem, Enumeration Theorem, and S-M-N Theorems.
reference-request
reference-request
asked Jan 16 at 18:08
SprinkleSprinkle
40629
asked Jan 16 at 18:08
SprinkleSprinkle
40629
asked Jan 16 at 18:08
SprinkleSprinkle
40629
asked Jan 16 at 18:08
SprinkleSprinkle
40629
asked Jan 16 at 18:08
SprinkleSprinkle
40629
40629
add a comment |
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3076070%2freference-for-detailed-exposition-of-recursion-computability-theory%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3076070%2freference-for-detailed-exposition-of-recursion-computability-theory%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
