How can I prove that binary multiplication decision problem is solved in O(logn) space?
0
$begingroup$
I can prove this if I use a NTM Turing Machine, but it is required to use a two-taped DTM, while taking into account only the space of the second "work tape"
proof-verification computational-complexity turing-machines
asked Jan 11 at 12:31
RiseosRiseos
1
$endgroup$
add a comment |
0
$begingroup$
I can prove this if I use a NTM Turing Machine, but it is required to use a two-taped DTM, while taking into account only the space of the second "work tape"
proof-verification computational-complexity turing-machines
asked Jan 11 at 12:31
RiseosRiseos
1
$endgroup$
$begingroup$
Can you provide an outline of how you would handle this using the NTM and where you get stuck moving to the DTM? Questions with context and shown-working tend to be better received and answered.
$endgroup$
– postmortes
Jan 11 at 12:40
$begingroup$
When you say "NTM Turing Machine", does that mean "Non-deterministic Turing Machine Turing Machine"?
$endgroup$
– Arthur
Jan 11 at 13:44
$begingroup$
Refer to the section titled 'Optimizing Space Complexity' in the link en.wikipedia.org/wiki/Multiplication_algorithm.
$endgroup$
– user137481
Jan 15 at 23:40
add a comment |
0
0
0
$begingroup$
I can prove this if I use a NTM Turing Machine, but it is required to use a two-taped DTM, while taking into account only the space of the second "work tape"
proof-verification computational-complexity turing-machines
asked Jan 11 at 12:31
RiseosRiseos
1
$endgroup$
I can prove this if I use a NTM Turing Machine, but it is required to use a two-taped DTM, while taking into account only the space of the second "work tape"
proof-verification computational-complexity turing-machines
proof-verification computational-complexity turing-machines
asked Jan 11 at 12:31
RiseosRiseos
1
asked Jan 11 at 12:31
RiseosRiseos
1
asked Jan 11 at 12:31
RiseosRiseos
1
asked Jan 11 at 12:31
RiseosRiseos
1
asked Jan 11 at 12:31
RiseosRiseos
1
1
$begingroup$
Can you provide an outline of how you would handle this using the NTM and where you get stuck moving to the DTM? Questions with context and shown-working tend to be better received and answered.
$endgroup$
– postmortes
Jan 11 at 12:40
$begingroup$
When you say "NTM Turing Machine", does that mean "Non-deterministic Turing Machine Turing Machine"?
$endgroup$
– Arthur
Jan 11 at 13:44
$begingroup$
Refer to the section titled 'Optimizing Space Complexity' in the link en.wikipedia.org/wiki/Multiplication_algorithm.
$endgroup$
– user137481
Jan 15 at 23:40
add a comment |
$begingroup$
Can you provide an outline of how you would handle this using the NTM and where you get stuck moving to the DTM? Questions with context and shown-working tend to be better received and answered.
$endgroup$
– postmortes
Jan 11 at 12:40
$begingroup$
When you say "NTM Turing Machine", does that mean "Non-deterministic Turing Machine Turing Machine"?
$endgroup$
– Arthur
Jan 11 at 13:44
$begingroup$
Refer to the section titled 'Optimizing Space Complexity' in the link en.wikipedia.org/wiki/Multiplication_algorithm.
$endgroup$
– user137481
Jan 15 at 23:40
$begingroup$
Can you provide an outline of how you would handle this using the NTM and where you get stuck moving to the DTM? Questions with context and shown-working tend to be better received and answered.
$endgroup$
– postmortes
Jan 11 at 12:40
$begingroup$
Can you provide an outline of how you would handle this using the NTM and where you get stuck moving to the DTM? Questions with context and shown-working tend to be better received and answered.
$endgroup$
– postmortes
Jan 11 at 12:40
$begingroup$
When you say "NTM Turing Machine", does that mean "Non-deterministic Turing Machine Turing Machine"?
$endgroup$
– Arthur
Jan 11 at 13:44
$begingroup$
When you say "NTM Turing Machine", does that mean "Non-deterministic Turing Machine Turing Machine"?
$endgroup$
– Arthur
Jan 11 at 13:44
$begingroup$
Refer to the section titled 'Optimizing Space Complexity' in the link en.wikipedia.org/wiki/Multiplication_algorithm.
$endgroup$
– user137481
Jan 15 at 23:40
$begingroup$
Refer to the section titled 'Optimizing Space Complexity' in the link en.wikipedia.org/wiki/Multiplication_algorithm.
$endgroup$
– user137481
Jan 15 at 23:40
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
});
}
});
draft saved
draft discarded
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%2f3069782%2fhow-can-i-prove-that-binary-multiplication-decision-problem-is-solved-in-ologn%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
draft saved
draft discarded
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.
draft saved
draft discarded
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%2f3069782%2fhow-can-i-prove-that-binary-multiplication-decision-problem-is-solved-in-ologn%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
$begingroup$
Can you provide an outline of how you would handle this using the NTM and where you get stuck moving to the DTM? Questions with context and shown-working tend to be better received and answered.
$endgroup$
– postmortes
Jan 11 at 12:40
$begingroup$
When you say "NTM Turing Machine", does that mean "Non-deterministic Turing Machine Turing Machine"?
$endgroup$
– Arthur
Jan 11 at 13:44
$begingroup$
Refer to the section titled 'Optimizing Space Complexity' in the link en.wikipedia.org/wiki/Multiplication_algorithm.
$endgroup$
– user137481
Jan 15 at 23:40