The complexity of completions in partial combinatory algebra
From MaRDI portal
Publication:6444874
arXiv2307.12685MaRDI QIDQ6444874FDOQ6444874
Authors: Sebastiaan A. Terwijn 
Publication date: 24 July 2023
Other Turing degree structures (03D28) Theory of numerations, effectively presented structures (03D45) Applications of computability and recursion theory (03D80)
This page was built for publication: The complexity of completions in partial combinatory algebra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6444874)
