Pages that link to "Item:Q2720396"
From MaRDI portal
The following pages link to Revision sequences and computers with an infinite amount of time (Q2720396):
Displaying 12 items.
- Comparing inductive and circular definitions: Parameters, complexity and games (Q817681) (← links)
- Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and normal form theorems (Q1004086) (← links)
- What's in a function? (Q1293042) (← links)
- Supertasks do not increase computational power (Q1761709) (← links)
- Rethinking revision (Q2420716) (← links)
- On Gupta-Belnap revision theories of truth, Kripkean fixed points and the next stable set (Q2778662) (← links)
- Discrete transfinite computation models (Q2906573) (← links)
- On revision operators (Q3160562) (← links)
- (Q4530726) (← links)
- Characterisations of variant transfinite computational models: Infinite time Turing, ordinal time Turing, and Blum–Shub–Smale machines (Q4995609) (← links)
- A NOTE ON THEORIES FOR QUASI-INDUCTIVE DEFINITIONS (Q5850984) (← links)
- Guest editors' introduction (Q5920212) (← links)