What is the “description†of a Turing machine?
Clash 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
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
add a comment |Â
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
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
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
add a comment |Â
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
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
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
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
turing-machines halting-problem
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
add a comment |Â
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
add a comment |Â
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).
add a comment |Â
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).
add a comment |Â
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).
add a comment |Â
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).
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).
answered 3 hours ago


David Richerby
63k1595180
63k1595180
add a comment |Â
add a comment |Â
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
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
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
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
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
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