Non-deterministic computation and the Jayne-Rogers Theorem

@inproceedings{Pauly2012NondeterministicCA,
  title={Non-deterministic computation and the Jayne-Rogers Theorem},
  author={Arno Pauly and Matthew de Brecht},
  booktitle={DCM},
  year={2012}
}
Non-deterministic type-2 machines (NDTMs) were suggested by Ziegler [34, 35, 33] as a model for hypercomputation in computable analysis. As demonstrated by Brattka, de Brecht and Pauly [2, 6], the strength of various kinds of type-2 non-deter-minism neatly classifies various important classes of noncomputable functions; and a characterization of such classes as those functions computable by certain NDTMs opens up new, simple ways to prove closure properties for them. A NDTM with advice space Z… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 2 times over the past 90 days. VIEW TWEETS
21 Citations
12 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 12 references

Some observations on ’ A New Proof of a Theorem of Jayne and Rogers ’

  • Miroslav Kačena
  • Journal de Mathématiques Pures et Appliquées
  • 2012

A New Proof of a Theorem of Jayne and Rogers

  • Luca Motto Ros, Brian Semmes
  • Mathematical Logic Quarterly
  • 2009

Similar Papers

Loading similar papers…