Skip to main content
MathOverflow

Return to Question

added 5 characters in body
Source Link
Bjørn Kjos-Hanssen
Bjørn Kjos-Hanssen
  • 24.8k
  • 3
  • 58
  • 114

A real $r$ is computable,if for if given any $i\in \mathbb{N}$,the the $i$ bitsth bit can be outputed by a Turing Machine or an algorithm. So, what isis computational complexity or complexitycomplexity measure of computing the real? Since there is just a Turing Machine or a program without input,what is the computational complexity or complexity measure of computing reals ?

what is the computational complexity or complexity measure of computing reals?

Any definition and result? Intuitively, the computational complexity or complexity measure may be defined in the termterms of the size of output, like length of thethe binary sequence of the outputed real.

A real $r$ is computable,if for any $i\in \mathbb{N}$,the $i$ bits can be outputed by a Turing Machine or an algorithm. So, what is computational complexity or complexity measure of computing the real? Since there is just a Turing Machine or a program without input,what is the computational complexity or complexity measure of computing reals ? Any definition and result? Intuitively, the computational complexity or complexity measure may defined in the term of the size of output, like length of the binary sequence of the outputed real.

A real $r$ is computable if given any $i\in \mathbb{N}$, the $i$th bit can be outputed by a Turing Machine or an algorithm. So, what is computational complexity or complexity measure of computing the real? Since there is just a Turing Machine or a program without input,

what is the computational complexity or complexity measure of computing reals?

Any definition and result? Intuitively, the computational complexity or complexity measure may be defined in terms of the size of output, like length of the binary sequence of the outputed real.

deleted 2 characters in body
Source Link
XL _At_Here_There
XL _At_Here_There
  • 3.1k
  • 17
  • 31

A real $r$ is computable,if for any $i\in \mathbb{N}$,the $i$ bits can be outputed by a Turing Machine or an algorithm. So, what it is is computational complexity or complexity measure of computing the real? Since there is just a Turing Machine or a program without input,what is the computational complexity or complexity measure of computing reals ? Any definition and result? Intuitively, the computational complexity or complexity measure may defined in the term of the size of output, like length of the binary sequence of the outputed real.

A real $r$ is computable,if for any $i\in \mathbb{N}$,the $i$ bits can be outputed by a Turing Machine or an algorithm. So, what it is computational complexity or complexity measure of computing the real? Since there is just a Turing Machine or a program without input,what is the computational complexity or complexity measure of computing reals ? Any definition and result? Intuitively, the computational complexity or complexity measure may defined in the term of the size of output, like length of the binary sequence of the outputed real.

A real $r$ is computable,if for any $i\in \mathbb{N}$,the $i$ bits can be outputed by a Turing Machine or an algorithm. So, what is computational complexity or complexity measure of computing the real? Since there is just a Turing Machine or a program without input,what is the computational complexity or complexity measure of computing reals ? Any definition and result? Intuitively, the computational complexity or complexity measure may defined in the term of the size of output, like length of the binary sequence of the outputed real.

Post Closed as "Needs details or clarity" by Andrés E. Caicedo, Qiaochu Yuan, Stefan Kohl♦, Emil Jeřábek, John Pardon
Source Link
XL _At_Here_There
XL _At_Here_There
  • 3.1k
  • 17
  • 31

The definition of computational complexity or complexity measure of computing reals

A real $r$ is computable,if for any $i\in \mathbb{N}$,the $i$ bits can be outputed by a Turing Machine or an algorithm. So, what it is computational complexity or complexity measure of computing the real? Since there is just a Turing Machine or a program without input,what is the computational complexity or complexity measure of computing reals ? Any definition and result? Intuitively, the computational complexity or complexity measure may defined in the term of the size of output, like length of the binary sequence of the outputed real.