• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Eventually infinite time Turing machine degrees: Infinite time decidable reals (0)

by Philip Welch
Venue:Journal of Symbolic Logic
Add To MetaCart

Tools

Sorted by:
Results 1 - 1 of 1

ITTMs with Feedback

by Robert S. Lubarsky , 2009
"... Infinite time Turing machines are extended in several ways to allow for iterated oracle calls. The expressive power of these machines is discussed and in some cases determined. 1 ..."
Abstract - Add to MetaCart
Infinite time Turing machines are extended in several ways to allow for iterated oracle calls. The expressive power of these machines is discussed and in some cases determined. 1
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University