Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and normal form theorems
From MaRDI portal
Publication:1004086
Recommendations
Cites work
- scientific article; zbMATH DE number 3861143 (Why is no real title available?)
- scientific article; zbMATH DE number 3726331 (Why is no real title available?)
- scientific article; zbMATH DE number 3494394 (Why is no real title available?)
- scientific article; zbMATH DE number 3595177 (Why is no real title available?)
- scientific article; zbMATH DE number 1176133 (Why is no real title available?)
- scientific article; zbMATH DE number 1948172 (Why is no real title available?)
- scientific article; zbMATH DE number 3264932 (Why is no real title available?)
- scientific article; zbMATH DE number 3073037 (Why is no real title available?)
- A fine hierarchy of partition cardinals
- Classical and new paradigms of computation and their complexity hierarchies. Papers of the conference ``Foundations of the formal sciences III, Vienna, Austria, September 21-24, 2001.
- Classical recursion theory. The theory of functions and sets of natural numbers
- Deciding Arithmetic Using SAD Computers
- Descriptive set theory
- Eventually infinite time Turing machine degrees: infinite time decidable reals
- Infinite time Turing machines
- Infinite time Turing machines with only one tape
- New Computational Paradigms
- Non-Turing computations via Malament--Hogarth space-times
- P ≠ NP ∩ co-NP for Infinite Time Turing Machines
- Parameter-free uniformisation
- Post's problem for supertasks has both positive and negative solutions
- Recent Advances in Ordinal Analysis: Π12— CA and Related Systems
- Recursive Functionals and Quantifiers of Finite Types I
- Revision sequences and computers with an infinite amount of time
- Set-theoretic absoluteness and the revision theory of truth
- Subsystems of second order arithmetic
- The Extent of Computation in Malament–Hogarth Spacetimes
- The Length of Infinite Time Turing Machine Computations
- The fine structure of the constructible hierarchy
- The truth is never simple
Cited in
(20)- Infinite time busy beavers
- Symmetry for transfinite computability
- RANDOMNESS VIA INFINITE COMPUTATION AND EFFECTIVE DESCRIPTIVE SET THEORY
- Properties of stabilizing computations
- Some observations on truth hierarchies
- scientific article; zbMATH DE number 4005621 (Why is no real title available?)
- Bounding lemmata for non-deterministic halting times of transfinite Turing machines
- Decision times of infinite computations
- The recognizability strength of infinite time Turing machines with ordinal parameters
- Infinite time Turing machines with only one tape
- scientific article; zbMATH DE number 1909830 (Why is no real title available?)
- Halting time is predictable for large models: a universality property and average-case analysis
- Clockability for ordinal Turing machines
- The computational strengths of \(\alpha\)-tape infinite time Turing machines
- Taming Koepke's zoo. II: Register machines
- Weaker variants of infinite time Turing machines
- Characterisations of variant transfinite computational models: Infinite time Turing, ordinal time Turing, and Blum–Shub–Smale machines
- New Computational Paradigms
- Admissibles in gaps
- Hypermachines
This page was built for publication: Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and normal form theorems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1004086)
