Some basic questions on halt and move in Turing machines“Print 'em all game” for Turing machinesPower of variants of Turing machinesThe control in the Turing MachineThe halting problem of Turing machines in view of enumeration of initial tape configurationsDifficulty in the halting problem for a simple Turing machine with standard enumerations of programs and of initial tape configurationsTuring machine that computes w#w when the input is w?Construct a Turing Machine that recognizes the set $0^2n1^n$For multi-tape Turing machines, can we assume that each tape can be in its own state independently of the other tapes?How would you create a Turing machine that copies a string and prints it to the tape?Turing machine - Transition between two states by more than one condition allowed?

Is this homebrew feat, Beast of Burden, balanced?

Shall I use personal or official e-mail account when registering to external websites for work purpose?

Manga about a female worker who got dragged into another world together with this high school girl and she was just told she's not needed anymore

Is "plugging out" electronic devices an American expression?

Symmetry in quantum mechanics

I’m planning on buying a laser printer but concerned about the life cycle of toner in the machine

Is every set a filtered colimit of finite sets?

How many letters suffice to construct words with no repetition?

Finding files for which a command fails

Could Giant Ground Sloths have been a Good Pack Animal for the Ancient Mayans

New order #4: World

How to manage monthly salary

Landlord wants to switch my lease to a "Land contract" to "get back at the city"

What is GPS' 19 year rollover and does it present a cybersecurity issue?

Is there a way to make member function NOT callable from constructor?

Is repealing the EU Withdrawal Act a precondition of revoking Article 50?

Is domain driven design an anti-SQL pattern?

How do you conduct xenoanthropology after first contact?

Prime joint compound before latex paint?

Can I legally use front facing blue light in the UK?

Copycat chess is back

Is Social Media Science Fiction?

What do you call something that goes against the spirit of the law, but is legal when interpreting the law to the letter?

Are white and non-white police officers equally likely to kill black suspects?



Some basic questions on halt and move in Turing machines


“Print 'em all game” for Turing machinesPower of variants of Turing machinesThe control in the Turing MachineThe halting problem of Turing machines in view of enumeration of initial tape configurationsDifficulty in the halting problem for a simple Turing machine with standard enumerations of programs and of initial tape configurationsTuring machine that computes w#w when the input is w?Construct a Turing Machine that recognizes the set $ngeq 0$For multi-tape Turing machines, can we assume that each tape can be in its own state independently of the other tapes?How would you create a Turing machine that copies a string and prints it to the tape?Turing machine - Transition between two states by more than one condition allowed?













2












$begingroup$


Im trying to learn about and set up Turing Machines (TMs) the simplest ways using the simplest definite rules. I am using my previous knowledge on simple Cellular Automata to do this. I want to write the computer code, but first I have to get some understanding of the restrictions and possibilities of TMs.



Firstly i define an operation as follows:



Operation (Op)



Do operation based on current color ($C$) and its state ($S$) i.e. $Op(c, s)$:



  1. replace color $C$ with $0$ or $1$. (at current position of tape head) move

  2. tape-head (change its position).

  3. change state $S$ with $0$ or $1$ (at new position).

For each operation:



  • In general does a TM only have only one halting-operation?
    (i.e. can only one operation promote the halting or can more than one operation do that?).


  • Can the tape-head also stop at a fixed position? (i.e. not move its head).
    Instead of the rules $0$ (move left) and $1$ (move right), it can also $2$ (not move anywhere) or even jump two units to the left or right?


My last question is basically the same as the last question..



  • Can the tape-head move more than one unit to the left or right?

The reason I ask this, is because if there is only one halting state in no more than one operation, the number of rules (in my setup) can be reduced. And if the tape-head can move more than one unit either to the left or right or both my guess is that it can produce more complex outputs. But my questions are concerning what is the limitations of a Turing Machine.



Example



If something was unclear I can try this example:



 inp: outp:
Op(0,0) => 110
Op(0,1) => 101
Op(1,0) => 111
Op(1,1) => 001*


Of the output ($b_2b_1b_0$), where the first bit ($b_0$) represent the tapehead-move direction, $b_1$ represents the new state, and $b_0$ represents the changed color.
The asterisk shows that a halting operation should be performed.



The first question I asked wether there was possible to have more than one halting operation in a TM. Basically I ask wether I can have two or more asterisks like this, or if its not allowed:



 inp: outp:
Op(0,0) => 110
Op(0,1) => 101
Op(1,0) => 111*
Op(1,1) => 001*


Recap



So can more than one operation perform the halting operation?



Can we move the tape head more than one unit to the left or right, or can it stand still?










share|cite|improve this question









$endgroup$











  • $begingroup$
    You can define your Turing machine model in whichever reasonable way you want, as long as the resulting model is equal in power to a standard Turing machine.
    $endgroup$
    – Yuval Filmus
    9 hours ago






  • 1




    $begingroup$
    If you are interested in a specific model of Turing machines, then you'll have to specify your model, and then you'll likely be able to answer these questions on your own.
    $endgroup$
    – Yuval Filmus
    9 hours ago










  • $begingroup$
    Thanks, but where can I find info on a standard Turing machine? Was my above descriptions close?
    $endgroup$
    – Natural Number Guy
    9 hours ago






  • 3




    $begingroup$
    There is no single standard model of a Turing machine. You can find (similar but not identical) definitions on Wikipedia and in any number of textbooks.
    $endgroup$
    – Yuval Filmus
    9 hours ago















2












$begingroup$


Im trying to learn about and set up Turing Machines (TMs) the simplest ways using the simplest definite rules. I am using my previous knowledge on simple Cellular Automata to do this. I want to write the computer code, but first I have to get some understanding of the restrictions and possibilities of TMs.



Firstly i define an operation as follows:



Operation (Op)



Do operation based on current color ($C$) and its state ($S$) i.e. $Op(c, s)$:



  1. replace color $C$ with $0$ or $1$. (at current position of tape head) move

  2. tape-head (change its position).

  3. change state $S$ with $0$ or $1$ (at new position).

For each operation:



  • In general does a TM only have only one halting-operation?
    (i.e. can only one operation promote the halting or can more than one operation do that?).


  • Can the tape-head also stop at a fixed position? (i.e. not move its head).
    Instead of the rules $0$ (move left) and $1$ (move right), it can also $2$ (not move anywhere) or even jump two units to the left or right?


My last question is basically the same as the last question..



  • Can the tape-head move more than one unit to the left or right?

The reason I ask this, is because if there is only one halting state in no more than one operation, the number of rules (in my setup) can be reduced. And if the tape-head can move more than one unit either to the left or right or both my guess is that it can produce more complex outputs. But my questions are concerning what is the limitations of a Turing Machine.



Example



If something was unclear I can try this example:



 inp: outp:
Op(0,0) => 110
Op(0,1) => 101
Op(1,0) => 111
Op(1,1) => 001*


Of the output ($b_2b_1b_0$), where the first bit ($b_0$) represent the tapehead-move direction, $b_1$ represents the new state, and $b_0$ represents the changed color.
The asterisk shows that a halting operation should be performed.



The first question I asked wether there was possible to have more than one halting operation in a TM. Basically I ask wether I can have two or more asterisks like this, or if its not allowed:



 inp: outp:
Op(0,0) => 110
Op(0,1) => 101
Op(1,0) => 111*
Op(1,1) => 001*


Recap



So can more than one operation perform the halting operation?



Can we move the tape head more than one unit to the left or right, or can it stand still?










share|cite|improve this question









$endgroup$











  • $begingroup$
    You can define your Turing machine model in whichever reasonable way you want, as long as the resulting model is equal in power to a standard Turing machine.
    $endgroup$
    – Yuval Filmus
    9 hours ago






  • 1




    $begingroup$
    If you are interested in a specific model of Turing machines, then you'll have to specify your model, and then you'll likely be able to answer these questions on your own.
    $endgroup$
    – Yuval Filmus
    9 hours ago










  • $begingroup$
    Thanks, but where can I find info on a standard Turing machine? Was my above descriptions close?
    $endgroup$
    – Natural Number Guy
    9 hours ago






  • 3




    $begingroup$
    There is no single standard model of a Turing machine. You can find (similar but not identical) definitions on Wikipedia and in any number of textbooks.
    $endgroup$
    – Yuval Filmus
    9 hours ago













2












2








2





$begingroup$


Im trying to learn about and set up Turing Machines (TMs) the simplest ways using the simplest definite rules. I am using my previous knowledge on simple Cellular Automata to do this. I want to write the computer code, but first I have to get some understanding of the restrictions and possibilities of TMs.



Firstly i define an operation as follows:



Operation (Op)



Do operation based on current color ($C$) and its state ($S$) i.e. $Op(c, s)$:



  1. replace color $C$ with $0$ or $1$. (at current position of tape head) move

  2. tape-head (change its position).

  3. change state $S$ with $0$ or $1$ (at new position).

For each operation:



  • In general does a TM only have only one halting-operation?
    (i.e. can only one operation promote the halting or can more than one operation do that?).


  • Can the tape-head also stop at a fixed position? (i.e. not move its head).
    Instead of the rules $0$ (move left) and $1$ (move right), it can also $2$ (not move anywhere) or even jump two units to the left or right?


My last question is basically the same as the last question..



  • Can the tape-head move more than one unit to the left or right?

The reason I ask this, is because if there is only one halting state in no more than one operation, the number of rules (in my setup) can be reduced. And if the tape-head can move more than one unit either to the left or right or both my guess is that it can produce more complex outputs. But my questions are concerning what is the limitations of a Turing Machine.



Example



If something was unclear I can try this example:



 inp: outp:
Op(0,0) => 110
Op(0,1) => 101
Op(1,0) => 111
Op(1,1) => 001*


Of the output ($b_2b_1b_0$), where the first bit ($b_0$) represent the tapehead-move direction, $b_1$ represents the new state, and $b_0$ represents the changed color.
The asterisk shows that a halting operation should be performed.



The first question I asked wether there was possible to have more than one halting operation in a TM. Basically I ask wether I can have two or more asterisks like this, or if its not allowed:



 inp: outp:
Op(0,0) => 110
Op(0,1) => 101
Op(1,0) => 111*
Op(1,1) => 001*


Recap



So can more than one operation perform the halting operation?



Can we move the tape head more than one unit to the left or right, or can it stand still?










share|cite|improve this question









$endgroup$




Im trying to learn about and set up Turing Machines (TMs) the simplest ways using the simplest definite rules. I am using my previous knowledge on simple Cellular Automata to do this. I want to write the computer code, but first I have to get some understanding of the restrictions and possibilities of TMs.



Firstly i define an operation as follows:



Operation (Op)



Do operation based on current color ($C$) and its state ($S$) i.e. $Op(c, s)$:



  1. replace color $C$ with $0$ or $1$. (at current position of tape head) move

  2. tape-head (change its position).

  3. change state $S$ with $0$ or $1$ (at new position).

For each operation:



  • In general does a TM only have only one halting-operation?
    (i.e. can only one operation promote the halting or can more than one operation do that?).


  • Can the tape-head also stop at a fixed position? (i.e. not move its head).
    Instead of the rules $0$ (move left) and $1$ (move right), it can also $2$ (not move anywhere) or even jump two units to the left or right?


My last question is basically the same as the last question..



  • Can the tape-head move more than one unit to the left or right?

The reason I ask this, is because if there is only one halting state in no more than one operation, the number of rules (in my setup) can be reduced. And if the tape-head can move more than one unit either to the left or right or both my guess is that it can produce more complex outputs. But my questions are concerning what is the limitations of a Turing Machine.



Example



If something was unclear I can try this example:



 inp: outp:
Op(0,0) => 110
Op(0,1) => 101
Op(1,0) => 111
Op(1,1) => 001*


Of the output ($b_2b_1b_0$), where the first bit ($b_0$) represent the tapehead-move direction, $b_1$ represents the new state, and $b_0$ represents the changed color.
The asterisk shows that a halting operation should be performed.



The first question I asked wether there was possible to have more than one halting operation in a TM. Basically I ask wether I can have two or more asterisks like this, or if its not allowed:



 inp: outp:
Op(0,0) => 110
Op(0,1) => 101
Op(1,0) => 111*
Op(1,1) => 001*


Recap



So can more than one operation perform the halting operation?



Can we move the tape head more than one unit to the left or right, or can it stand still?







turing-machines automata






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked 9 hours ago









Natural Number GuyNatural Number Guy

1154




1154











  • $begingroup$
    You can define your Turing machine model in whichever reasonable way you want, as long as the resulting model is equal in power to a standard Turing machine.
    $endgroup$
    – Yuval Filmus
    9 hours ago






  • 1




    $begingroup$
    If you are interested in a specific model of Turing machines, then you'll have to specify your model, and then you'll likely be able to answer these questions on your own.
    $endgroup$
    – Yuval Filmus
    9 hours ago










  • $begingroup$
    Thanks, but where can I find info on a standard Turing machine? Was my above descriptions close?
    $endgroup$
    – Natural Number Guy
    9 hours ago






  • 3




    $begingroup$
    There is no single standard model of a Turing machine. You can find (similar but not identical) definitions on Wikipedia and in any number of textbooks.
    $endgroup$
    – Yuval Filmus
    9 hours ago
















  • $begingroup$
    You can define your Turing machine model in whichever reasonable way you want, as long as the resulting model is equal in power to a standard Turing machine.
    $endgroup$
    – Yuval Filmus
    9 hours ago






  • 1




    $begingroup$
    If you are interested in a specific model of Turing machines, then you'll have to specify your model, and then you'll likely be able to answer these questions on your own.
    $endgroup$
    – Yuval Filmus
    9 hours ago










  • $begingroup$
    Thanks, but where can I find info on a standard Turing machine? Was my above descriptions close?
    $endgroup$
    – Natural Number Guy
    9 hours ago






  • 3




    $begingroup$
    There is no single standard model of a Turing machine. You can find (similar but not identical) definitions on Wikipedia and in any number of textbooks.
    $endgroup$
    – Yuval Filmus
    9 hours ago















$begingroup$
You can define your Turing machine model in whichever reasonable way you want, as long as the resulting model is equal in power to a standard Turing machine.
$endgroup$
– Yuval Filmus
9 hours ago




$begingroup$
You can define your Turing machine model in whichever reasonable way you want, as long as the resulting model is equal in power to a standard Turing machine.
$endgroup$
– Yuval Filmus
9 hours ago




1




1




$begingroup$
If you are interested in a specific model of Turing machines, then you'll have to specify your model, and then you'll likely be able to answer these questions on your own.
$endgroup$
– Yuval Filmus
9 hours ago




$begingroup$
If you are interested in a specific model of Turing machines, then you'll have to specify your model, and then you'll likely be able to answer these questions on your own.
$endgroup$
– Yuval Filmus
9 hours ago












$begingroup$
Thanks, but where can I find info on a standard Turing machine? Was my above descriptions close?
$endgroup$
– Natural Number Guy
9 hours ago




$begingroup$
Thanks, but where can I find info on a standard Turing machine? Was my above descriptions close?
$endgroup$
– Natural Number Guy
9 hours ago




3




3




$begingroup$
There is no single standard model of a Turing machine. You can find (similar but not identical) definitions on Wikipedia and in any number of textbooks.
$endgroup$
– Yuval Filmus
9 hours ago




$begingroup$
There is no single standard model of a Turing machine. You can find (similar but not identical) definitions on Wikipedia and in any number of textbooks.
$endgroup$
– Yuval Filmus
9 hours ago










1 Answer
1






active

oldest

votes


















7












$begingroup$

To answer any kind of question like this, you need to choose one of the standard definitions of Turing machines (there are several but they're all essentially the same) and prove that adding the feature you want doesn't increase the computational power. You do that by showing how to simulate the feature using the standard machine.




  • In general does a TM only have only one halting-operation? (i.e. can only one operation promote the halting or can more than one operation do that?).



It doesn't matter. If you want three halting states and I insist that there can be only one, then have three states called $h_1$, $h_2$ and $h_3$ and design the transition function so that, if the machine ever enters one of those, its next transition is to $mathrmHALT$.




  • Can the tape-head also stop at a fixed position? (i.e. not move its head). Instead of the rules 0 (move left) and 1 (move right), it can also 2 (not move anywhere) or even jump two units to the left or right?



Again, it doesn't matter. If I insist you must move left or right, you can move one step left and then move back to the right; you can move two steps to the right by moving one step, twice.




  • Can the tape-head move more than one unit to the left or right?



Even that doesn't affect things: random-access Turing machines have an "address tape" onto which you can write a number and a special state that causes the head to move straight to the tape cell indexed by that number. Again, same power.



Multiple tapes, inserting and deleting characters, two-dimensional (or more!) tapes. Almost anything you can imagine makes no difference, and proving these things are standard exercises in computation theory textbooks.






share|cite|improve this answer









$endgroup$












  • $begingroup$
    One more question: What about the Buzzy Beaver TM, does the same rules apply there? Or do they have restricted rules on the movements and halting ops.
    $endgroup$
    – Natural Number Guy
    1 hour ago










  • $begingroup$
    You can ask the busy beaver question for any specific definition of Turing machines. It probably doesn't make a lot of difference to the answer -- it's uncomputable regardless, and the answer to any busy beaver question is "some huge number".
    $endgroup$
    – David Richerby
    21 mins ago











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',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
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
,
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%2f106651%2fsome-basic-questions-on-halt-and-move-in-turing-machines%23new-answer', 'question_page');

);

Post as a guest















Required, but never shown

























1 Answer
1






active

oldest

votes








1 Answer
1






active

oldest

votes









active

oldest

votes






active

oldest

votes









7












$begingroup$

To answer any kind of question like this, you need to choose one of the standard definitions of Turing machines (there are several but they're all essentially the same) and prove that adding the feature you want doesn't increase the computational power. You do that by showing how to simulate the feature using the standard machine.




  • In general does a TM only have only one halting-operation? (i.e. can only one operation promote the halting or can more than one operation do that?).



It doesn't matter. If you want three halting states and I insist that there can be only one, then have three states called $h_1$, $h_2$ and $h_3$ and design the transition function so that, if the machine ever enters one of those, its next transition is to $mathrmHALT$.




  • Can the tape-head also stop at a fixed position? (i.e. not move its head). Instead of the rules 0 (move left) and 1 (move right), it can also 2 (not move anywhere) or even jump two units to the left or right?



Again, it doesn't matter. If I insist you must move left or right, you can move one step left and then move back to the right; you can move two steps to the right by moving one step, twice.




  • Can the tape-head move more than one unit to the left or right?



Even that doesn't affect things: random-access Turing machines have an "address tape" onto which you can write a number and a special state that causes the head to move straight to the tape cell indexed by that number. Again, same power.



Multiple tapes, inserting and deleting characters, two-dimensional (or more!) tapes. Almost anything you can imagine makes no difference, and proving these things are standard exercises in computation theory textbooks.






share|cite|improve this answer









$endgroup$












  • $begingroup$
    One more question: What about the Buzzy Beaver TM, does the same rules apply there? Or do they have restricted rules on the movements and halting ops.
    $endgroup$
    – Natural Number Guy
    1 hour ago










  • $begingroup$
    You can ask the busy beaver question for any specific definition of Turing machines. It probably doesn't make a lot of difference to the answer -- it's uncomputable regardless, and the answer to any busy beaver question is "some huge number".
    $endgroup$
    – David Richerby
    21 mins ago















7












$begingroup$

To answer any kind of question like this, you need to choose one of the standard definitions of Turing machines (there are several but they're all essentially the same) and prove that adding the feature you want doesn't increase the computational power. You do that by showing how to simulate the feature using the standard machine.




  • In general does a TM only have only one halting-operation? (i.e. can only one operation promote the halting or can more than one operation do that?).



It doesn't matter. If you want three halting states and I insist that there can be only one, then have three states called $h_1$, $h_2$ and $h_3$ and design the transition function so that, if the machine ever enters one of those, its next transition is to $mathrmHALT$.




  • Can the tape-head also stop at a fixed position? (i.e. not move its head). Instead of the rules 0 (move left) and 1 (move right), it can also 2 (not move anywhere) or even jump two units to the left or right?



Again, it doesn't matter. If I insist you must move left or right, you can move one step left and then move back to the right; you can move two steps to the right by moving one step, twice.




  • Can the tape-head move more than one unit to the left or right?



Even that doesn't affect things: random-access Turing machines have an "address tape" onto which you can write a number and a special state that causes the head to move straight to the tape cell indexed by that number. Again, same power.



Multiple tapes, inserting and deleting characters, two-dimensional (or more!) tapes. Almost anything you can imagine makes no difference, and proving these things are standard exercises in computation theory textbooks.






share|cite|improve this answer









$endgroup$












  • $begingroup$
    One more question: What about the Buzzy Beaver TM, does the same rules apply there? Or do they have restricted rules on the movements and halting ops.
    $endgroup$
    – Natural Number Guy
    1 hour ago










  • $begingroup$
    You can ask the busy beaver question for any specific definition of Turing machines. It probably doesn't make a lot of difference to the answer -- it's uncomputable regardless, and the answer to any busy beaver question is "some huge number".
    $endgroup$
    – David Richerby
    21 mins ago













7












7








7





$begingroup$

To answer any kind of question like this, you need to choose one of the standard definitions of Turing machines (there are several but they're all essentially the same) and prove that adding the feature you want doesn't increase the computational power. You do that by showing how to simulate the feature using the standard machine.




  • In general does a TM only have only one halting-operation? (i.e. can only one operation promote the halting or can more than one operation do that?).



It doesn't matter. If you want three halting states and I insist that there can be only one, then have three states called $h_1$, $h_2$ and $h_3$ and design the transition function so that, if the machine ever enters one of those, its next transition is to $mathrmHALT$.




  • Can the tape-head also stop at a fixed position? (i.e. not move its head). Instead of the rules 0 (move left) and 1 (move right), it can also 2 (not move anywhere) or even jump two units to the left or right?



Again, it doesn't matter. If I insist you must move left or right, you can move one step left and then move back to the right; you can move two steps to the right by moving one step, twice.




  • Can the tape-head move more than one unit to the left or right?



Even that doesn't affect things: random-access Turing machines have an "address tape" onto which you can write a number and a special state that causes the head to move straight to the tape cell indexed by that number. Again, same power.



Multiple tapes, inserting and deleting characters, two-dimensional (or more!) tapes. Almost anything you can imagine makes no difference, and proving these things are standard exercises in computation theory textbooks.






share|cite|improve this answer









$endgroup$



To answer any kind of question like this, you need to choose one of the standard definitions of Turing machines (there are several but they're all essentially the same) and prove that adding the feature you want doesn't increase the computational power. You do that by showing how to simulate the feature using the standard machine.




  • In general does a TM only have only one halting-operation? (i.e. can only one operation promote the halting or can more than one operation do that?).



It doesn't matter. If you want three halting states and I insist that there can be only one, then have three states called $h_1$, $h_2$ and $h_3$ and design the transition function so that, if the machine ever enters one of those, its next transition is to $mathrmHALT$.




  • Can the tape-head also stop at a fixed position? (i.e. not move its head). Instead of the rules 0 (move left) and 1 (move right), it can also 2 (not move anywhere) or even jump two units to the left or right?



Again, it doesn't matter. If I insist you must move left or right, you can move one step left and then move back to the right; you can move two steps to the right by moving one step, twice.




  • Can the tape-head move more than one unit to the left or right?



Even that doesn't affect things: random-access Turing machines have an "address tape" onto which you can write a number and a special state that causes the head to move straight to the tape cell indexed by that number. Again, same power.



Multiple tapes, inserting and deleting characters, two-dimensional (or more!) tapes. Almost anything you can imagine makes no difference, and proving these things are standard exercises in computation theory textbooks.







share|cite|improve this answer












share|cite|improve this answer



share|cite|improve this answer










answered 8 hours ago









David RicherbyDavid Richerby

69.8k15106195




69.8k15106195











  • $begingroup$
    One more question: What about the Buzzy Beaver TM, does the same rules apply there? Or do they have restricted rules on the movements and halting ops.
    $endgroup$
    – Natural Number Guy
    1 hour ago










  • $begingroup$
    You can ask the busy beaver question for any specific definition of Turing machines. It probably doesn't make a lot of difference to the answer -- it's uncomputable regardless, and the answer to any busy beaver question is "some huge number".
    $endgroup$
    – David Richerby
    21 mins ago
















  • $begingroup$
    One more question: What about the Buzzy Beaver TM, does the same rules apply there? Or do they have restricted rules on the movements and halting ops.
    $endgroup$
    – Natural Number Guy
    1 hour ago










  • $begingroup$
    You can ask the busy beaver question for any specific definition of Turing machines. It probably doesn't make a lot of difference to the answer -- it's uncomputable regardless, and the answer to any busy beaver question is "some huge number".
    $endgroup$
    – David Richerby
    21 mins ago















$begingroup$
One more question: What about the Buzzy Beaver TM, does the same rules apply there? Or do they have restricted rules on the movements and halting ops.
$endgroup$
– Natural Number Guy
1 hour ago




$begingroup$
One more question: What about the Buzzy Beaver TM, does the same rules apply there? Or do they have restricted rules on the movements and halting ops.
$endgroup$
– Natural Number Guy
1 hour ago












$begingroup$
You can ask the busy beaver question for any specific definition of Turing machines. It probably doesn't make a lot of difference to the answer -- it's uncomputable regardless, and the answer to any busy beaver question is "some huge number".
$endgroup$
– David Richerby
21 mins ago




$begingroup$
You can ask the busy beaver question for any specific definition of Turing machines. It probably doesn't make a lot of difference to the answer -- it's uncomputable regardless, and the answer to any busy beaver question is "some huge number".
$endgroup$
– David Richerby
21 mins ago

















draft saved

draft discarded
















































Thanks for contributing an answer to Computer Science 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.




draft saved


draft discarded














StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcs.stackexchange.com%2fquestions%2f106651%2fsome-basic-questions-on-halt-and-move-in-turing-machines%23new-answer', 'question_page');

);

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







Popular posts from this blog

Are there any AGPL-style licences that require source code modifications to be public? Planned maintenance scheduled April 23, 2019 at 23:30 UTC (7:30pm US/Eastern) Announcing the arrival of Valued Associate #679: Cesar Manara Unicorn Meta Zoo #1: Why another podcast?Force derivative works to be publicAre there any GPL like licenses for Apple App Store?Do you violate the GPL if you provide source code that cannot be compiled?GPL - is it distribution to use libraries in an appliance loaned to customers?Distributing App for free which uses GPL'ed codeModifications of server software under GPL, with web/CLI interfaceDoes using an AGPLv3-licensed library prevent me from dual-licensing my own source code?Can I publish only select code under GPLv3 from a private project?Is there published precedent regarding the scope of covered work that uses AGPL software?If MIT licensed code links to GPL licensed code what should be the license of the resulting binary program?If I use a public API endpoint that has its source code licensed under AGPL in my app, do I need to disclose my source?

2013 GY136 Descoberta | Órbita | Referências Menu de navegação«List Of Centaurs and Scattered-Disk Objects»«List of Known Trans-Neptunian Objects»

Mortes em março de 2019 Referências Menu de navegação«Zhores Alferov, Nobel de Física bielorrusso, morre aos 88 anos - Ciência»«Fallece Rafael Torija, o bispo emérito de Ciudad Real»«Peter Hurford dies at 88»«Keith Flint, vocalista do The Prodigy, morre aos 49 anos»«Luke Perry, ator de 'Barrados no baile' e 'Riverdale', morre aos 52 anos»«Former Rangers and Scotland captain Eric Caldow dies, aged 84»«Morreu, aos 61 anos, a antiga lenda do wrestling King Kong Bundy»«Fallece el actor y director teatral Abraham Stavans»«In Memoriam Guillaume Faye»«Sidney Sheinberg, a Force Behind Universal and Spielberg, Is Dead at 84»«Carmine Persico, Colombo Crime Family Boss, Is Dead at 85»«Dirigent Michael Gielen gestorben»«Ciclista tricampeã mundial e prata na Rio 2016 é encontrada morta em casa aos 23 anos»«Pagan Community Notes: Raven Grimassi dies, Indianapolis pop-up event cancelled, Circle Sanctuary announces new podcast, and more!»«Hal Blaine, Wrecking Crew Drummer, Dies at 90»«Morre Coutinho, que editou dupla lendária com Pelé no Santos»«Cantor Demétrius, ídolo da Jovem Guarda, morre em SP»«Ex-presidente do Vasco, Eurico Miranda morre no Rio de Janeiro»«Bronze no Mundial de basquete de 1971, Laís Elena morre aos 76 anos»«Diretor de Corridas da F1, Charlie Whiting morre aos 66 anos às vésperas do GP da Austrália»«Morreu o cardeal Danneels, da Bélgica»«Morreu o cartoonista Augusto Cid»«Morreu a atriz Maria Isabel de Lizandra, de "Vale Tudo" e novelas da Tupi»«WS Merwin, prize-winning poet of nature, dies at 91»«Atriz Márcia Real morre em São Paulo aos 88 anos»«Mauritanie: décès de l'ancien président Mohamed Mahmoud ould Louly»«Morreu Dick Dale, o rei da surf guitar e de "Pulp Fiction"»«Falleció Víctor Genes»«João Carlos Marinho, autor de 'O Gênio do Crime', morre em SP»«Legendary Horror Director and SFX Artist John Carl Buechler Dies at 66»«Morre em Salvador a religiosa Makota Valdina»«مرگ بازیکن‌ سابق نساجی بر اثر سقوط سنگ در مازندران»«Domingos Oliveira morre no Rio»«Morre Airton Ravagniani, ex-São Paulo, Fla, Vasco, Grêmio e Sport - Notícias»«Morre o escritor Flavio Moreira da Costa»«Larry Cohen, Writer-Director of 'It's Alive' and 'Hell Up in Harlem,' Dies at 77»«Scott Walker, experimental singer-songwriter, dead at 76»«Joseph Pilato, Day of the Dead Star and Horror Favorite, Dies at 70»«Sheffield United set to pay tribute to legendary goalkeeper Ted Burgin who has died at 91»«Morre Rafael Henzel, sobrevivente de acidente aéreo da Chapecoense»«Morre Valery Bykovsky, um dos primeiros cosmonautas da União Soviética»«Agnès Varda, cineasta da Nouvelle Vague, morre aos 90 anos»«Agnès Varda, cineasta francesa, morre aos 90 anos»«Tania Mallet, James Bond Actress and Helen Mirren's Cousin, Dies at 77»e