Turing projectability

DOI10.1305/NDJFL/1093637647zbMATH Open0645.03038OpenAlexW4245927665MaRDI QIDQ1102947FDOQ1102947

Authors: Stewart Shapiro, Timothy McCarthy 

Publication date: 1987

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1305/ndjfl/1093637647

Recommendations

• Publication:4508548
• scientific article; zbMATH DE number 3924764
• On the Church-Turing thesis and relative recursion
• scientific article; zbMATH DE number 3952035
• Turing Computations On Ordinals

zbMATH Keywords

inductive logicnumber-theoretic functionTuring computable functionTuring projectable functions

Mathematics Subject Classification ID

Probability and inductive logic (03B48) Recursive functions and relations, subrecursive hierarchies (03D20) Turing machines and related notions (03D10)

Cited In (4)

• Trial and error mathematics. I: Dialectical and quasidialectical systems
• A logic for trial and error classifiers
• Turing Jumps Through Provability
• Incompleteness, Mechanism, and Optimism

This page was built for publication: Turing projectability

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