The following pages link to Infinite time Turing machines (Q4508248):
Displaying 50 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)
- Admissibles in gaps (Q2011650) (← links)
- Koepke machines and satisfiability for infinitary propositional languages (Q2011652) (← links)
- The recognizability strength of infinite time Turing machines with ordinal parameters (Q2011653) (← links)
- Infinite time busy beavers (Q2011657) (← links)
- Clocked population protocols (Q2040025) (← links)
- Taming Koepke's zoo. II: Register machines (Q2067510) (← links)
- Exploring mathematical objects from custom-tailored mathematical universes (Q2080581) (← links)
- Clockability for ordinal Turing machines (Q2106588) (← links)
- The lost melody theorem for infinite time Blum-Shub-Smale machines (Q2117767) (← links)
- Descriptive set theory, from Cantor to Wadge and beyond (Q2148861) (← links)
- Between Turing and Kleene (Q2151416) (← links)
- Decision times of infinite computations (Q2153830) (← links)
- The basic theory of infinite time register machines (Q2267751) (← links)
- Weaker variants of infinite time Turing machines (Q2309496) (← links)
- On the classification of vertex-transitive structures (Q2312084) (← links)
- On TAE machines and their computational power (Q2334651) (← links)
- Cofinally invariant sequences and revision (Q2350973) (← links)
- Higher randomness and forcing with closed sets (Q2363960) (← links)
- On fixpoint arithmetic and infinite time Turing machines (Q2390295) (← links)
- The computational power of infinite time Blum-Shub-Smale machines (Q2401544) (← links)
- Rethinking revision (Q2420716) (← links)
- The distribution of ITRM-recognizable reals (Q2453067) (← links)
- The computational strengths of \(\alpha\)-tape infinite time Turing machines (Q2453073) (← links)
- Minimality considerations for ordinal computers modeling constructibility (Q2482462) (← links)
- Bounding lemmata for non-deterministic halting times of transfinite Turing machines (Q2482464) (← links)
- A new Gödelian argument for hypercomputing minds based on the busy beaver problem (Q2495984) (← links)
- The case for hypercomputation (Q2497872) (← links)
- The many forms of hypercomputation (Q2497883) (← links)
- Computational power of infinite quantum parallelism (Q2498972) (← links)
- THE MYTH OF 'THE MYTH OF HYPERCOMPUTATION' (Q2842654) (← links)
- Some Transfinite Generalisations of Gödel’s Incompleteness Theorem (Q2891311) (← links)
- Discrete Transfinite Computation (Q2906573) (← links)
- SOME OBSERVATIONS ON TRUTH HIERARCHIES (Q2940864) (← links)
