Pages that link to "Item:Q5425382"
From MaRDI portal
The following pages link to Turing Unbound: Transfinite Computation (Q5425382):
Displaying 6 items.
- Computation as an unbounded process (Q418791) (← links)
- Some Transfinite Generalisations of Gödel’s Incompleteness Theorem (Q2891311) (← links)
- Discrete transfinite computation models (Q2906573) (← links)
- Turing Jumps Through Provability (Q3195699) (← links)
- Unconventional “Stateless” Turing–Like Machines (Q3603403) (← links)
- (Q4205412) (← links)