Pages that link to "Item:Q1694811"

The following pages link to Recognizable sets and Woodin cardinals: computation beyond the constructible universe (Q1694811):

Displaying 4 items.

• The recognizability strength of infinite time Turing machines with ordinal parameters (Q2011653) (← links)
• The lost melody theorem for infinite time Blum-Shub-Smale machines (Q2117767) (← links)
• RANDOMNESS VIA INFINITE COMPUTATION AND EFFECTIVE DESCRIPTIVE SET THEORY (Q4579818) (← links)
• Effectivity and reducibility with ordinal Turing machines (Q5037207) (← links)