Post's problem for ordinal register machines: an explicit approach

DOI10.1016/J.APAL.2009.01.004zbMath1178.03060OpenAlexW1964503372MaRDI QIDQ1032632

Joel David Hamkins, Russell G. Miller

Publication date: 26 October 2009

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2009.01.004

zbMATH Keywords

ordinal computabilityordinal register machinePost's problem

Mathematics Subject Classification ID

Turing machines and related notions (03D10) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items (1)

Discrete Transfinite Computation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Register computations on ordinals
• Ordinal machines and admissible recursion theory
• Post's problem for supertasks has both positive and negative solutions
• TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
• Turing Computations On Ordinals
• Post's program and incomplete recursively enumerable sets.
• The Length of Infinite Time Turing Machine Computations
• Infinite time Turing machines
• Post’s Problem for Ordinal Register Machines
• The α-finite injury method

This page was built for publication: Post's problem for ordinal register machines: an explicit approach