Computability with two-place oracle

DOI10.1007/BF02104579MaRDI QIDQ1920828zbMATH OpenFDO

Authors L. N. Pobedin

Publication date 12 May 1997

Published in Siberian Mathematical Journal (Search for Journal in Brave)

zbMATH Keywords

Turing machinehalting problempartial functionspartial oracle

Mathematics Subject Classification ID

Turing machines and related notions (03D10)

Recommendations

• scientific article; zbMATH DE number 1191231
• Computability with an oracle in both classical and alternative infinity
• Computations with oracles
• On a certain nontraditional version of computations with oracles
• Generalized computations with oracles
• scientific article; zbMATH DE number 4079399
• Generalized computations with binary oracles
• scientific article; zbMATH DE number 6731539
• Computational complexity with experiments as oracles
• Computable Dowd-type generic oracles

Cites work

• scientific article; zbMATH DE number 3506658 (Why is no real title available?)
• scientific article; zbMATH DE number 625232 (Why is no real title available?)
• Iterated Kleene computability
• Recursive Functionals and Quantifiers of Finite Types I

Cited in

(2)

• scientific article; zbMATH DE number 1191231 (Why is no real title available?)
• Generalized computations with binary oracles

This page was built for publication: Computability with two-place oracle

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