A note on Autoreducibility for Infinite Time Register Machines and parameter-free Ordinal Turing Machines

preprint2014arXivOpen access

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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.