If a non-deterministic Turing machine runs in f(n) space, then why does it run in 2^O(f(n)) time?
Assuming that f(n) >= n.
If possible, I'd like a proof in terms of Turing machines. I understand the reason why with machines that run on binary, because each "tape cell" is a bit with either 0 or 1, but in Turing machines a tape cell could hold any number of symbols. I'm having trouble why the base is '2' and not something like 'b' where 'b' is the number of types of symbols of the Turing machine tape.
complexity-theory turing-machines
asked 5 hours ago
Taking1n1
62
New contributor
Taking1n1 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
add a comment |
Assuming that f(n) >= n.
If possible, I'd like a proof in terms of Turing machines. I understand the reason why with machines that run on binary, because each "tape cell" is a bit with either 0 or 1, but in Turing machines a tape cell could hold any number of symbols. I'm having trouble why the base is '2' and not something like 'b' where 'b' is the number of types of symbols of the Turing machine tape.
complexity-theory turing-machines
asked 5 hours ago
Taking1n1
62
New contributor
Taking1n1 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
I think your reasoning is correct, but we measure space in the number of bits required to represent the space. So even if a single symbol could be 0,1,..7, we count that as 3 bits.
– Albert Hendriks
5 hours ago
That is the worst case. As is also shown by the use of O notation. It is commonly referred to the encoding in the CLRS. Since every character can be encoded in a minimum of 2 characters. If you encode using only one than you will have a linear complexity in input length rather than the logarithmic complexity the binary encoding offers. Which when applied to a linear problem will give a theoretical exponential complexity. Please refer to CLRS, Introduction to Algorithms part on NP completeness for better explanation.
– anon
4 hours ago
Is it necessary or helpful in any way to assume $f(n)ge n$?
– Apass.Jack
3 hours ago
add a comment |
Assuming that f(n) >= n.
If possible, I'd like a proof in terms of Turing machines. I understand the reason why with machines that run on binary, because each "tape cell" is a bit with either 0 or 1, but in Turing machines a tape cell could hold any number of symbols. I'm having trouble why the base is '2' and not something like 'b' where 'b' is the number of types of symbols of the Turing machine tape.
complexity-theory turing-machines
asked 5 hours ago
Taking1n1
62
New contributor
Taking1n1 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
Assuming that f(n) >= n.
If possible, I'd like a proof in terms of Turing machines. I understand the reason why with machines that run on binary, because each "tape cell" is a bit with either 0 or 1, but in Turing machines a tape cell could hold any number of symbols. I'm having trouble why the base is '2' and not something like 'b' where 'b' is the number of types of symbols of the Turing machine tape.
complexity-theory turing-machines
complexity-theory turing-machines
asked 5 hours ago
Taking1n1
62
New contributor
Taking1n1 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked 5 hours ago
Taking1n1
62
New contributor
Taking1n1 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked 5 hours ago
Taking1n1
62
New contributor
Taking1n1 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked 5 hours ago
Taking1n1
62
asked 5 hours ago
Taking1n1
62
62
New contributor
Taking1n1 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
Taking1n1 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
Taking1n1 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
I think your reasoning is correct, but we measure space in the number of bits required to represent the space. So even if a single symbol could be 0,1,..7, we count that as 3 bits.
– Albert Hendriks
5 hours ago
That is the worst case. As is also shown by the use of O notation. It is commonly referred to the encoding in the CLRS. Since every character can be encoded in a minimum of 2 characters. If you encode using only one than you will have a linear complexity in input length rather than the logarithmic complexity the binary encoding offers. Which when applied to a linear problem will give a theoretical exponential complexity. Please refer to CLRS, Introduction to Algorithms part on NP completeness for better explanation.
– anon
4 hours ago
Is it necessary or helpful in any way to assume $f(n)ge n$?
– Apass.Jack
3 hours ago
add a comment |
I think your reasoning is correct, but we measure space in the number of bits required to represent the space. So even if a single symbol could be 0,1,..7, we count that as 3 bits.
– Albert Hendriks
5 hours ago
That is the worst case. As is also shown by the use of O notation. It is commonly referred to the encoding in the CLRS. Since every character can be encoded in a minimum of 2 characters. If you encode using only one than you will have a linear complexity in input length rather than the logarithmic complexity the binary encoding offers. Which when applied to a linear problem will give a theoretical exponential complexity. Please refer to CLRS, Introduction to Algorithms part on NP completeness for better explanation.
– anon
4 hours ago
Is it necessary or helpful in any way to assume $f(n)ge n$?
– Apass.Jack
3 hours ago
I think your reasoning is correct, but we measure space in the number of bits required to represent the space. So even if a single symbol could be 0,1,..7, we count that as 3 bits.
– Albert Hendriks
5 hours ago
I think your reasoning is correct, but we measure space in the number of bits required to represent the space. So even if a single symbol could be 0,1,..7, we count that as 3 bits.
– Albert Hendriks
5 hours ago
That is the worst case. As is also shown by the use of O notation. It is commonly referred to the encoding in the CLRS. Since every character can be encoded in a minimum of 2 characters. If you encode using only one than you will have a linear complexity in input length rather than the logarithmic complexity the binary encoding offers. Which when applied to a linear problem will give a theoretical exponential complexity. Please refer to CLRS, Introduction to Algorithms part on NP completeness for better explanation.
– anon
4 hours ago
That is the worst case. As is also shown by the use of O notation. It is commonly referred to the encoding in the CLRS. Since every character can be encoded in a minimum of 2 characters. If you encode using only one than you will have a linear complexity in input length rather than the logarithmic complexity the binary encoding offers. Which when applied to a linear problem will give a theoretical exponential complexity. Please refer to CLRS, Introduction to Algorithms part on NP completeness for better explanation.
– anon
4 hours ago
Is it necessary or helpful in any way to assume $f(n)ge n$?
– Apass.Jack
3 hours ago
Is it necessary or helpful in any way to assume $f(n)ge n$?
– Apass.Jack
3 hours ago
add a comment |
1 Answer
1
active
oldest
votes
why the base is '2' and not something like 'b' where 'b' is the number of types of symbols of the Turing machine tape?
Because it does not matter in the sense that $2^{O(f(n))} = b^{O(f(n))}$ for any positive $b > 1$.
According to the popular set-theoretic understanding of the big $O$-notation,
$$begin{align}
2^{O(f(n))}&={2^{g(n)}mid g(n)in O(f(n))} \
&={left(b^{log_b2}right)^{g(n)}mid g(n)in O(f(n))} \
&={b^{h(n)}mid exists g(n), h(n)= log_b2g(n), g(n)in O(f(n))} \
&={b^{h(n)}mid h(n)in O(f(n))} \
&=b^{O(f(n))}end{align}$$
answered 3 hours ago
Apass.Jack
7,1841533
add a comment |
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
});
}
});
Taking1n1 is a new contributor. Be nice, and check out our Code of Conduct.
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%2fcs.stackexchange.com%2fquestions%2f102260%2fif-a-non-deterministic-turing-machine-runs-in-fn-space-then-why-does-it-run-i%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
why the base is '2' and not something like 'b' where 'b' is the number of types of symbols of the Turing machine tape?
Because it does not matter in the sense that $2^{O(f(n))} = b^{O(f(n))}$ for any positive $b > 1$.
According to the popular set-theoretic understanding of the big $O$-notation,
$$begin{align}
2^{O(f(n))}&={2^{g(n)}mid g(n)in O(f(n))} \
&={left(b^{log_b2}right)^{g(n)}mid g(n)in O(f(n))} \
&={b^{h(n)}mid exists g(n), h(n)= log_b2g(n), g(n)in O(f(n))} \
&={b^{h(n)}mid h(n)in O(f(n))} \
&=b^{O(f(n))}end{align}$$
answered 3 hours ago
Apass.Jack
7,1841533
add a comment |
why the base is '2' and not something like 'b' where 'b' is the number of types of symbols of the Turing machine tape?
Because it does not matter in the sense that $2^{O(f(n))} = b^{O(f(n))}$ for any positive $b > 1$.
According to the popular set-theoretic understanding of the big $O$-notation,
$$begin{align}
2^{O(f(n))}&={2^{g(n)}mid g(n)in O(f(n))} \
&={left(b^{log_b2}right)^{g(n)}mid g(n)in O(f(n))} \
&={b^{h(n)}mid exists g(n), h(n)= log_b2g(n), g(n)in O(f(n))} \
&={b^{h(n)}mid h(n)in O(f(n))} \
&=b^{O(f(n))}end{align}$$
answered 3 hours ago
Apass.Jack
7,1841533
add a comment |
why the base is '2' and not something like 'b' where 'b' is the number of types of symbols of the Turing machine tape?
Because it does not matter in the sense that $2^{O(f(n))} = b^{O(f(n))}$ for any positive $b > 1$.
According to the popular set-theoretic understanding of the big $O$-notation,
$$begin{align}
2^{O(f(n))}&={2^{g(n)}mid g(n)in O(f(n))} \
&={left(b^{log_b2}right)^{g(n)}mid g(n)in O(f(n))} \
&={b^{h(n)}mid exists g(n), h(n)= log_b2g(n), g(n)in O(f(n))} \
&={b^{h(n)}mid h(n)in O(f(n))} \
&=b^{O(f(n))}end{align}$$
answered 3 hours ago
Apass.Jack
7,1841533
why the base is '2' and not something like 'b' where 'b' is the number of types of symbols of the Turing machine tape?
Because it does not matter in the sense that $2^{O(f(n))} = b^{O(f(n))}$ for any positive $b > 1$.
According to the popular set-theoretic understanding of the big $O$-notation,
$$begin{align}
2^{O(f(n))}&={2^{g(n)}mid g(n)in O(f(n))} \
&={left(b^{log_b2}right)^{g(n)}mid g(n)in O(f(n))} \
&={b^{h(n)}mid exists g(n), h(n)= log_b2g(n), g(n)in O(f(n))} \
&={b^{h(n)}mid h(n)in O(f(n))} \
&=b^{O(f(n))}end{align}$$
answered 3 hours ago
Apass.Jack
7,1841533
answered 3 hours ago
Apass.Jack
7,1841533
answered 3 hours ago
Apass.Jack
7,1841533
answered 3 hours ago
Apass.Jack
7,1841533
7,1841533
add a comment |
add a comment |
Taking1n1 is a new contributor. Be nice, and check out our Code of Conduct.
Taking1n1 is a new contributor. Be nice, and check out our Code of Conduct.
Taking1n1 is a new contributor. Be nice, and check out our Code of Conduct.
Taking1n1 is a new contributor. Be nice, and check out our Code of Conduct.
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.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- 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.
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%2fcs.stackexchange.com%2fquestions%2f102260%2fif-a-non-deterministic-turing-machine-runs-in-fn-space-then-why-does-it-run-i%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
I think your reasoning is correct, but we measure space in the number of bits required to represent the space. So even if a single symbol could be 0,1,..7, we count that as 3 bits.
– Albert Hendriks
5 hours ago
That is the worst case. As is also shown by the use of O notation. It is commonly referred to the encoding in the CLRS. Since every character can be encoded in a minimum of 2 characters. If you encode using only one than you will have a linear complexity in input length rather than the logarithmic complexity the binary encoding offers. Which when applied to a linear problem will give a theoretical exponential complexity. Please refer to CLRS, Introduction to Algorithms part on NP completeness for better explanation.
– anon
4 hours ago
Is it necessary or helpful in any way to assume $f(n)ge n$?
– Apass.Jack
3 hours ago