Computation with Advice

Details Computation with Advice Computation with Advice

2010-06-02

arxiv.org/abs/1006.0395v1

EPTCS 24, 2010, pp. 41-55

Computer Science

Logic in Computer Science

Scientific paper

10.4204/EPTCS.24.9

Computation with advice is suggested as generalization of both computation with discrete advice and Type-2 Nondeterminism. Several embodiments of the generic concept are discussed, and the close connection to Weihrauch reducibility is pointed out. As a novel concept, computability with random advice is studied; which corresponds to correct solutions being guessable with positive probability. In the framework of computation with advice, it is possible to define computational complexity for certain concepts of hypercomputation. Finally, some examples are given which illuminate the interplay of uniform and non-uniform techniques in order to investigate both computability with advice and the Weihrauch lattice.

Affiliated with

Also associated with

No associations

Rating

Computation with Advice 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 Computation with Advice, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computation with Advice will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-512904