A note on Autoreducibility for Infinite Time Register Machines and   parameter-free Ordinal Turing Machines
  We propose a notion of autoreducibility for infinite time computability and explore it and its connection with a notion of randomness for infinite time machines. 
Merlin Carl
math.LO