Switch to: References

Add citations

You must login to add citations.
  1. Optimal Results on Recognizability for Infinite Time Register Machines.Merlin Carl - 2015 - Journal of Symbolic Logic 80 (4):1116-1130.
  • The Distribution of ITRM-Recognizable Reals.Merlin Carl - 2014 - Annals of Pure and Applied Logic 165 (9):1403-1417.
    Infinite Time Register Machines are a well-established machine model for infinitary computations. Their computational strength relative to oracles is understood, see e.g. , and . We consider the notion of recognizability, which was first formulated for Infinite Time Turing Machines in [6] and applied to ITRM 's in [3]. A real x is ITRM -recognizable iff there is an ITRM -program P such that PyPy stops with output 1 iff y=xy=x, and otherwise stops with output 0. In [3], it is (...))
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • Randomness Via Infinite Computation and Effective Descriptive Set Theory.Merlin Carl & Philipp Schlicht - 2018 - Journal of Symbolic Logic 83 (2):766-789.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  • Recognizable Sets and Woodin Cardinals: Computation Beyond the Constructible Universe.Merlin Carl, Philipp Schlicht & Philip Welch - 2018 - Annals of Pure and Applied Logic 169 (4):312-332.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation