The following pages link to Infinite time Turing machines (Q4508248):
Displaying 17 items.
- Computation as an unbounded process (Q418791) (← links)
- Ideal negative conceivability and the halting problem (Q485625) (← links)
- Output concepts for accelerated Turing machines (Q609032) (← links)
- Abstract geometrical computation. III: Black holes for classical and analog computing (Q734212) (← links)
- A broader view on the limitations of information processing and communication by nature (Q885681) (← links)
- Register computations on ordinals (Q944224) (← links)
- Computability on reals, infinite limits and differential equations (Q990444) (← links)
- Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and normal form theorems (Q1004086) (← links)
- Infinite time extensions of Kleene's \({\mathcal O}\) (Q1031833) (← links)
- Post's problem for ordinal register machines: an explicit approach (Q1032632) (← links)
- Preface: Super-recursive algorithms and hypercomputation. (Q1434364) (← links)
- Super-tasks, accelerating Turing machines and uncomputability (Q1434371) (← links)
- The modal argument for hypercomputing minds (Q1434374) (← links)
- Hypercomputation by definition (Q1434375) (← links)
- A representation of recursively enumerable sets through Horn formulas in higher recursion theory (Q1677584) (← links)
- Recognizable sets and Woodin cardinals: computation beyond the constructible universe (Q1694811) (← links)
- Supertasks do not increase computational power (Q1761709) (← links)
