A note on Autoreducibility for Infinite Time Register Machines and parameter-free Ordinal Turing Machines
classification
🧮 math.LO
keywords
infinitemachinestimeautoreducibilitynotioncomputabilityconnectionexplore
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.