Post’s Problem for Ordinal Register Machines

DOI10.1007/978-3-540-73001-9_37zbMath1151.03339OpenAlexW2109661184MaRDI QIDQ5425337

Joel David Hamkins, Russell G. Miller

Publication date: 13 November 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73001-9_37

zbMATH Keywords

computabilityordinal 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 (3)

An Enhanced Theory of Infinite Time Register Machines ⋮ The basic theory of infinite time register machines ⋮ Post's problem for ordinal register machines: an explicit approach

This page was built for publication: Post’s Problem for Ordinal Register Machines