A version of a Turing maching that can cut out and/or remove tape squares
$begingroup$
I would like to know if in the literature there have been considered versions of Turing machines that, instead of changing the content of one tape square at a time are allowed to perform more general moves, particularly adding new squares to the tape and cutting out existing squares. Specifically, where in a single transition the head can also insert new tape squares and or remove some new tape squares, say to the right and or to the left of the current position of the head, write something on any newly inserted tape squares, change the letter on the square that was being read, and then move left, right or stay put.
Or some version of the above. If some such versions of Turing machines have been considered, and if there are some standard names/terminology for them, I would very much like to know what they are. Thanks!
turing-machines
asked Dec 4 '18 at 20:33
Ilya KapovichIlya Kapovich
161
$endgroup$
add a comment |
$begingroup$
I would like to know if in the literature there have been considered versions of Turing machines that, instead of changing the content of one tape square at a time are allowed to perform more general moves, particularly adding new squares to the tape and cutting out existing squares. Specifically, where in a single transition the head can also insert new tape squares and or remove some new tape squares, say to the right and or to the left of the current position of the head, write something on any newly inserted tape squares, change the letter on the square that was being read, and then move left, right or stay put.
Or some version of the above. If some such versions of Turing machines have been considered, and if there are some standard names/terminology for them, I would very much like to know what they are. Thanks!
turing-machines
asked Dec 4 '18 at 20:33
Ilya KapovichIlya Kapovich
161
$endgroup$
1
$begingroup$
These moves are easy to simulate with Turing machines as defined in the Wikipedia article, say. I have not come across variant definitions including single transitions like this. (If you are solely interested in what is computable, such transitions don't add anything, while if you are interested in complexity issues, then such transitions seem to be rather unrealistic.)
$endgroup$
– Rob Arthan
Dec 4 '18 at 20:43
$begingroup$
@Rob Could a standard Turing machine insert an extra bit into an infinitely long tape without discarding an existing bit? (It would have to go to the far end and shift everything along, but there's no far end.)
$endgroup$
– timtfj
Dec 5 '18 at 1:17
$begingroup$
A Turing machine tape is defined as being padded with an infinite supply of cells marked with a blank symbol that does not appear in the part of the tape that initially represents the input data. You never need to write blanks other than at the ends of the interesting part of the tape. So you can code algorithms as if the far ends are known.
$endgroup$
– Rob Arthan
Dec 5 '18 at 1:28
$begingroup$
So an infinite tape containing pre-existing information (not blanks—maybe the digits of one transcendental nunber to the left and of another to the right, and it has to do some operation on them without discarding their digits) would be outside the definition?
$endgroup$
– timtfj
Dec 6 '18 at 2:56
add a comment |
$begingroup$
I would like to know if in the literature there have been considered versions of Turing machines that, instead of changing the content of one tape square at a time are allowed to perform more general moves, particularly adding new squares to the tape and cutting out existing squares. Specifically, where in a single transition the head can also insert new tape squares and or remove some new tape squares, say to the right and or to the left of the current position of the head, write something on any newly inserted tape squares, change the letter on the square that was being read, and then move left, right or stay put.
Or some version of the above. If some such versions of Turing machines have been considered, and if there are some standard names/terminology for them, I would very much like to know what they are. Thanks!
turing-machines
asked Dec 4 '18 at 20:33
Ilya KapovichIlya Kapovich
161
$endgroup$
I would like to know if in the literature there have been considered versions of Turing machines that, instead of changing the content of one tape square at a time are allowed to perform more general moves, particularly adding new squares to the tape and cutting out existing squares. Specifically, where in a single transition the head can also insert new tape squares and or remove some new tape squares, say to the right and or to the left of the current position of the head, write something on any newly inserted tape squares, change the letter on the square that was being read, and then move left, right or stay put.
Or some version of the above. If some such versions of Turing machines have been considered, and if there are some standard names/terminology for them, I would very much like to know what they are. Thanks!
turing-machines
turing-machines
asked Dec 4 '18 at 20:33
Ilya KapovichIlya Kapovich
161
asked Dec 4 '18 at 20:33
Ilya KapovichIlya Kapovich
161
asked Dec 4 '18 at 20:33
Ilya KapovichIlya Kapovich
161
asked Dec 4 '18 at 20:33
Ilya KapovichIlya Kapovich
161
asked Dec 4 '18 at 20:33
Ilya KapovichIlya Kapovich
161
161
1
$begingroup$
These moves are easy to simulate with Turing machines as defined in the Wikipedia article, say. I have not come across variant definitions including single transitions like this. (If you are solely interested in what is computable, such transitions don't add anything, while if you are interested in complexity issues, then such transitions seem to be rather unrealistic.)
$endgroup$
– Rob Arthan
Dec 4 '18 at 20:43
$begingroup$
@Rob Could a standard Turing machine insert an extra bit into an infinitely long tape without discarding an existing bit? (It would have to go to the far end and shift everything along, but there's no far end.)
$endgroup$
– timtfj
Dec 5 '18 at 1:17
$begingroup$
A Turing machine tape is defined as being padded with an infinite supply of cells marked with a blank symbol that does not appear in the part of the tape that initially represents the input data. You never need to write blanks other than at the ends of the interesting part of the tape. So you can code algorithms as if the far ends are known.
$endgroup$
– Rob Arthan
Dec 5 '18 at 1:28
$begingroup$
So an infinite tape containing pre-existing information (not blanks—maybe the digits of one transcendental nunber to the left and of another to the right, and it has to do some operation on them without discarding their digits) would be outside the definition?
$endgroup$
– timtfj
Dec 6 '18 at 2:56
add a comment |
1
$begingroup$
These moves are easy to simulate with Turing machines as defined in the Wikipedia article, say. I have not come across variant definitions including single transitions like this. (If you are solely interested in what is computable, such transitions don't add anything, while if you are interested in complexity issues, then such transitions seem to be rather unrealistic.)
$endgroup$
– Rob Arthan
Dec 4 '18 at 20:43
$begingroup$
@Rob Could a standard Turing machine insert an extra bit into an infinitely long tape without discarding an existing bit? (It would have to go to the far end and shift everything along, but there's no far end.)
$endgroup$
– timtfj
Dec 5 '18 at 1:17
$begingroup$
A Turing machine tape is defined as being padded with an infinite supply of cells marked with a blank symbol that does not appear in the part of the tape that initially represents the input data. You never need to write blanks other than at the ends of the interesting part of the tape. So you can code algorithms as if the far ends are known.
$endgroup$
– Rob Arthan
Dec 5 '18 at 1:28
$begingroup$
So an infinite tape containing pre-existing information (not blanks—maybe the digits of one transcendental nunber to the left and of another to the right, and it has to do some operation on them without discarding their digits) would be outside the definition?
$endgroup$
– timtfj
Dec 6 '18 at 2:56
1
1
$begingroup$
These moves are easy to simulate with Turing machines as defined in the Wikipedia article, say. I have not come across variant definitions including single transitions like this. (If you are solely interested in what is computable, such transitions don't add anything, while if you are interested in complexity issues, then such transitions seem to be rather unrealistic.)
$endgroup$
– Rob Arthan
Dec 4 '18 at 20:43
$begingroup$
These moves are easy to simulate with Turing machines as defined in the Wikipedia article, say. I have not come across variant definitions including single transitions like this. (If you are solely interested in what is computable, such transitions don't add anything, while if you are interested in complexity issues, then such transitions seem to be rather unrealistic.)
$endgroup$
– Rob Arthan
Dec 4 '18 at 20:43
$begingroup$
@Rob Could a standard Turing machine insert an extra bit into an infinitely long tape without discarding an existing bit? (It would have to go to the far end and shift everything along, but there's no far end.)
$endgroup$
– timtfj
Dec 5 '18 at 1:17
$begingroup$
@Rob Could a standard Turing machine insert an extra bit into an infinitely long tape without discarding an existing bit? (It would have to go to the far end and shift everything along, but there's no far end.)
$endgroup$
– timtfj
Dec 5 '18 at 1:17
$begingroup$
A Turing machine tape is defined as being padded with an infinite supply of cells marked with a blank symbol that does not appear in the part of the tape that initially represents the input data. You never need to write blanks other than at the ends of the interesting part of the tape. So you can code algorithms as if the far ends are known.
$endgroup$
– Rob Arthan
Dec 5 '18 at 1:28
$begingroup$
A Turing machine tape is defined as being padded with an infinite supply of cells marked with a blank symbol that does not appear in the part of the tape that initially represents the input data. You never need to write blanks other than at the ends of the interesting part of the tape. So you can code algorithms as if the far ends are known.
$endgroup$
– Rob Arthan
Dec 5 '18 at 1:28
$begingroup$
So an infinite tape containing pre-existing information (not blanks—maybe the digits of one transcendental nunber to the left and of another to the right, and it has to do some operation on them without discarding their digits) would be outside the definition?
$endgroup$
– timtfj
Dec 6 '18 at 2:56
$begingroup$
So an infinite tape containing pre-existing information (not blanks—maybe the digits of one transcendental nunber to the left and of another to the right, and it has to do some operation on them without discarding their digits) would be outside the definition?
$endgroup$
– timtfj
Dec 6 '18 at 2:56
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%2f3026123%2fa-version-of-a-turing-maching-that-can-cut-out-and-or-remove-tape-squares%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%2f3026123%2fa-version-of-a-turing-maching-that-can-cut-out-and-or-remove-tape-squares%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
1
$begingroup$
These moves are easy to simulate with Turing machines as defined in the Wikipedia article, say. I have not come across variant definitions including single transitions like this. (If you are solely interested in what is computable, such transitions don't add anything, while if you are interested in complexity issues, then such transitions seem to be rather unrealistic.)
$endgroup$
– Rob Arthan
Dec 4 '18 at 20:43
$begingroup$
@Rob Could a standard Turing machine insert an extra bit into an infinitely long tape without discarding an existing bit? (It would have to go to the far end and shift everything along, but there's no far end.)
$endgroup$
– timtfj
Dec 5 '18 at 1:17
$begingroup$
A Turing machine tape is defined as being padded with an infinite supply of cells marked with a blank symbol that does not appear in the part of the tape that initially represents the input data. You never need to write blanks other than at the ends of the interesting part of the tape. So you can code algorithms as if the far ends are known.
$endgroup$
– Rob Arthan
Dec 5 '18 at 1:28
$begingroup$
So an infinite tape containing pre-existing information (not blanks—maybe the digits of one transcendental nunber to the left and of another to the right, and it has to do some operation on them without discarding their digits) would be outside the definition?
$endgroup$
– timtfj
Dec 6 '18 at 2:56