An Explicit Solution to Post's Problem over the Reals

Details An Explicit Solution to Post's Problem over the Reals An Explicit Solution to Post's Problem over the Reals

2006-03-17

arxiv.org/abs/cs/0603071v1

Computer Science

Logic in Computer Science

submitted to Journal of Complexity

Scientific paper

In the BCSS model of real number computations we prove a concrete and explicit semi-decidable language to be undecidable yet not reducible from (and thus strictly easier than) the real Halting Language. This solution to Post's Problem over the reals significantly differs from its classical, discrete variant where advanced diagonalization techniques are only known to yield the existence of such intermediate Turing degrees. Strengthening the above result, we construct (that is, obtain again explicitly) as well an uncountable number of incomparable semi-decidable Turing degrees below the real Halting problem in the BCSS model. Finally we show the same to hold for the linear BCSS model, that is over (R,+,-,<) rather than (R,+,-,*,/,<).

Affiliated with

Also associated with

No associations

Rating

An Explicit Solution to Post's Problem over the Reals 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 An Explicit Solution to Post's Problem over the Reals, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Explicit Solution to Post's Problem over the Reals will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-80137