Representation of Turing machine to prove Cook-Levin theorem

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
0
down vote

favorite












How would one construct function which is representation of some Turing machine (which is in one state at each step) which can be used to prove the Cook-Levin theorem?
It is written on Wikipedia in section proof, if I understood It well, but I am curious how would that function look like ? Any hint on at least how to start would be great.







share|cite|improve this question





















  • the thing is that I came to this while reading proof of Cook-Levin theorem on wikipedia. And I dont have idea how this function would look like ? I asked for some hint :)
    – commandos2389
    Jul 23 at 10:33















up vote
0
down vote

favorite












How would one construct function which is representation of some Turing machine (which is in one state at each step) which can be used to prove the Cook-Levin theorem?
It is written on Wikipedia in section proof, if I understood It well, but I am curious how would that function look like ? Any hint on at least how to start would be great.







share|cite|improve this question





















  • the thing is that I came to this while reading proof of Cook-Levin theorem on wikipedia. And I dont have idea how this function would look like ? I asked for some hint :)
    – commandos2389
    Jul 23 at 10:33













up vote
0
down vote

favorite









up vote
0
down vote

favorite











How would one construct function which is representation of some Turing machine (which is in one state at each step) which can be used to prove the Cook-Levin theorem?
It is written on Wikipedia in section proof, if I understood It well, but I am curious how would that function look like ? Any hint on at least how to start would be great.







share|cite|improve this question













How would one construct function which is representation of some Turing machine (which is in one state at each step) which can be used to prove the Cook-Levin theorem?
It is written on Wikipedia in section proof, if I understood It well, but I am curious how would that function look like ? Any hint on at least how to start would be great.









share|cite|improve this question












share|cite|improve this question




share|cite|improve this question








edited Jul 23 at 10:39
























asked Jul 23 at 8:49









commandos2389

11




11











  • the thing is that I came to this while reading proof of Cook-Levin theorem on wikipedia. And I dont have idea how this function would look like ? I asked for some hint :)
    – commandos2389
    Jul 23 at 10:33

















  • the thing is that I came to this while reading proof of Cook-Levin theorem on wikipedia. And I dont have idea how this function would look like ? I asked for some hint :)
    – commandos2389
    Jul 23 at 10:33
















the thing is that I came to this while reading proof of Cook-Levin theorem on wikipedia. And I dont have idea how this function would look like ? I asked for some hint :)
– commandos2389
Jul 23 at 10:33





the thing is that I came to this while reading proof of Cook-Levin theorem on wikipedia. And I dont have idea how this function would look like ? I asked for some hint :)
– commandos2389
Jul 23 at 10:33
















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',
convertImagesToLinks: true,
noModals: false,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);



);








 

draft saved


draft discarded


















StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2860145%2frepresentation-of-turing-machine-to-prove-cook-levin-theorem%23new-answer', 'question_page');

);

Post as a guest



































active

oldest

votes













active

oldest

votes









active

oldest

votes






active

oldest

votes










 

draft saved


draft discarded


























 


draft saved


draft discarded














StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2860145%2frepresentation-of-turing-machine-to-prove-cook-levin-theorem%23new-answer', 'question_page');

);

Post as a guest













































































Comments

Popular posts from this blog

What is the equation of a 3D cone with generalised tilt?

Color the edges and diagonals of a regular polygon

Relationship between determinant of matrix and determinant of adjoint?