What is the “description” of a Turing machine?

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











up vote
1
down vote

favorite












I am currently reading about the Halting Problem in my course on the theory of computation and the following was given in my lecture slides



enter image description here



Now my question is that if $d$ is the description of a Turing machine, what exactly is $d$ from a strictly mathematical point of view? The way that $d$ is written above seems to suggest that $d in Q$ (i.e. that $d$ is a state of the Turing machine $T$), but I can't be entirely sure.










share|cite|improve this question





















  • Think of it as a listing of a program: a complete description of the TM, one which you could use to build the TM.
    – Rick Decker
    35 mins ago














up vote
1
down vote

favorite












I am currently reading about the Halting Problem in my course on the theory of computation and the following was given in my lecture slides



enter image description here



Now my question is that if $d$ is the description of a Turing machine, what exactly is $d$ from a strictly mathematical point of view? The way that $d$ is written above seems to suggest that $d in Q$ (i.e. that $d$ is a state of the Turing machine $T$), but I can't be entirely sure.










share|cite|improve this question





















  • Think of it as a listing of a program: a complete description of the TM, one which you could use to build the TM.
    – Rick Decker
    35 mins ago












up vote
1
down vote

favorite









up vote
1
down vote

favorite











I am currently reading about the Halting Problem in my course on the theory of computation and the following was given in my lecture slides



enter image description here



Now my question is that if $d$ is the description of a Turing machine, what exactly is $d$ from a strictly mathematical point of view? The way that $d$ is written above seems to suggest that $d in Q$ (i.e. that $d$ is a state of the Turing machine $T$), but I can't be entirely sure.










share|cite|improve this question













I am currently reading about the Halting Problem in my course on the theory of computation and the following was given in my lecture slides



enter image description here



Now my question is that if $d$ is the description of a Turing machine, what exactly is $d$ from a strictly mathematical point of view? The way that $d$ is written above seems to suggest that $d in Q$ (i.e. that $d$ is a state of the Turing machine $T$), but I can't be entirely sure.







turing-machines halting-problem






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked 3 hours ago









Perturbative

1113




1113











  • Think of it as a listing of a program: a complete description of the TM, one which you could use to build the TM.
    – Rick Decker
    35 mins ago
















  • Think of it as a listing of a program: a complete description of the TM, one which you could use to build the TM.
    – Rick Decker
    35 mins ago















Think of it as a listing of a program: a complete description of the TM, one which you could use to build the TM.
– Rick Decker
35 mins ago




Think of it as a listing of a program: a complete description of the TM, one which you could use to build the TM.
– Rick Decker
35 mins ago










1 Answer
1






active

oldest

votes

















up vote
3
down vote













The description is a string that encodes the formal specification of the machine, comprising:



  • the set of states,

  • the start state,

  • the set of halting states (or, where appropriate, the sets of accepting and rejecting states),

  • the tape alphabet,

  • the input alphabet,

  • the transition function.

Some authors also explicitly include the identity of the blank symbol in the description of the machine; others leave it to convention (e.g., stating that the alphabet will always be $c_1, dots, c_k$ for some $k$, and $c_1$ is the blank symbol).






share|cite|improve this answer




















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



    );













     

    draft saved


    draft discarded


















    StackExchange.ready(
    function ()
    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcs.stackexchange.com%2fquestions%2f99081%2fwhat-is-the-description-of-a-turing-machine%23new-answer', 'question_page');

    );

    Post as a guest






























    1 Answer
    1






    active

    oldest

    votes








    1 Answer
    1






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes








    up vote
    3
    down vote













    The description is a string that encodes the formal specification of the machine, comprising:



    • the set of states,

    • the start state,

    • the set of halting states (or, where appropriate, the sets of accepting and rejecting states),

    • the tape alphabet,

    • the input alphabet,

    • the transition function.

    Some authors also explicitly include the identity of the blank symbol in the description of the machine; others leave it to convention (e.g., stating that the alphabet will always be $c_1, dots, c_k$ for some $k$, and $c_1$ is the blank symbol).






    share|cite|improve this answer
























      up vote
      3
      down vote













      The description is a string that encodes the formal specification of the machine, comprising:



      • the set of states,

      • the start state,

      • the set of halting states (or, where appropriate, the sets of accepting and rejecting states),

      • the tape alphabet,

      • the input alphabet,

      • the transition function.

      Some authors also explicitly include the identity of the blank symbol in the description of the machine; others leave it to convention (e.g., stating that the alphabet will always be $c_1, dots, c_k$ for some $k$, and $c_1$ is the blank symbol).






      share|cite|improve this answer






















        up vote
        3
        down vote










        up vote
        3
        down vote









        The description is a string that encodes the formal specification of the machine, comprising:



        • the set of states,

        • the start state,

        • the set of halting states (or, where appropriate, the sets of accepting and rejecting states),

        • the tape alphabet,

        • the input alphabet,

        • the transition function.

        Some authors also explicitly include the identity of the blank symbol in the description of the machine; others leave it to convention (e.g., stating that the alphabet will always be $c_1, dots, c_k$ for some $k$, and $c_1$ is the blank symbol).






        share|cite|improve this answer












        The description is a string that encodes the formal specification of the machine, comprising:



        • the set of states,

        • the start state,

        • the set of halting states (or, where appropriate, the sets of accepting and rejecting states),

        • the tape alphabet,

        • the input alphabet,

        • the transition function.

        Some authors also explicitly include the identity of the blank symbol in the description of the machine; others leave it to convention (e.g., stating that the alphabet will always be $c_1, dots, c_k$ for some $k$, and $c_1$ is the blank symbol).







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered 3 hours ago









        David Richerby

        63k1595180




        63k1595180



























             

            draft saved


            draft discarded















































             


            draft saved


            draft discarded














            StackExchange.ready(
            function ()
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcs.stackexchange.com%2fquestions%2f99081%2fwhat-is-the-description-of-a-turing-machine%23new-answer', 'question_page');

            );

            Post as a guest













































































            Comments

            Popular posts from this blog

            What does second last employer means? [closed]

            List of Gilmore Girls characters

            Confectionery