Pages that link to "Item:Q2795911"

The following pages link to OPTIMAL RESULTS ON RECOGNIZABILITY FOR INFINITE TIME REGISTER MACHINES (Q2795911):

Displaying 4 items.

• The recognizability strength of infinite time Turing machines with ordinal parameters (Q2011653) (← links)
• Taming Koepke's zoo. II: Register machines (Q2067510) (← links)
• $$ITRM$$-Recognizability from Random Oracles (Q3195690) (← links)
• Randomness and degree theory for infinite time register machines1 (Q5740208) (← links)