Discrete transfinite computation

DOI10.1007/978-3-319-22156-4_6MaRDI QIDQ6828975zbMATH OpenFDO

Authors Philip D. Welch

Publication date 18 April 2018

Published in Turing’s Revolution (Search for Journal in Brave)

Full work available at URL https://hdl.handle.net/1983/4c923831-9ffb-4bdf-b5e7-862c66aa0829

zbMATH Keywords

computabilityconstructibilitygeneralized recursion theoryTuring machine

Mathematics Subject Classification ID

Turing machines and related notions (03D10) Other degrees and reducibilities in computability and recursion theory (03D30) Higher-type and set recursion theory (03D65) Inner models, including constructibility, ordinal definability, and core models (03E45)

Cited in

(1)

• Transfinite structured programming

This page was built for publication: Discrete transfinite computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6828975)