A definable number which cannot be approximated algorithmically

Details A definable number which cannot be approximated algorithmically A definable number which cannot be approximated algorithmically

2010-03-01

arxiv.org/abs/1003.0480v1

Computer Science

Computational Complexity

Scientific paper

The Turing machine (TM) and the Church thesis have formalized the concept of
computable number, this allowed to display non-computable numbers. This paper
defines the concept of number "approachable" by a TM and shows that some (if
not all) known non-computable numbers are approachable by TMs. Then an example
of a number not approachable by a TM is given.

Affiliated with

Also associated with

No associations

Rating

A definable number which cannot be approximated algorithmically does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A definable number which cannot be approximated algorithmically, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A definable number which cannot be approximated algorithmically will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-662895