Infinite Oracle Queries in Type-2 Machines (Extended Abstract)

Details Infinite Oracle Queries in Type-2 Machines (Extended Abstract) Infinite Oracle Queries in Type-2 Machines (Extended Abstract)

2009-07-20

arxiv.org/abs/0907.3230v1

Computer Science

Logic in Computer Science

Scientific paper

We define Oracle-Type-2-Machine capable of writing infinite oracle queries. In contrast to finite oracle queries, this extends the realm of oracle-computable functions into the discontinuous realm. Our definition is conservative; access to a computable oracle does not increase the computational power. Other models of real hypercomputation such as Ziegler's (finitely) revising computation or Type-2-Nondeterminism are shown to be special cases of Oracle-Type-2-Machines. Our approach offers an intuitive definition of the weakest machine model capable to simulate both Type-2-Machines and BSS machines.

Affiliated with

Also associated with

No associations

Rating

Infinite Oracle Queries in Type-2 Machines (Extended Abstract) 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 Infinite Oracle Queries in Type-2 Machines (Extended Abstract), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Infinite Oracle Queries in Type-2 Machines (Extended Abstract) will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-695656