Directions for computability theory beyond pure mathematical

MaRDI QIDQ3447198zbMATH OpenFDO

Authors John Case

Publication date 28 June 2007

zbMATH Keywords

computability theory

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Applications of computability and recursion theory (03D80)

Recommendations

• Computability and computable models
• Computability theory
• scientific article; zbMATH DE number 1344905
• General computability theory (a database of articles and books)
• scientific article; zbMATH DE number 4021127

Cited in

(6)

• Computability theory
• scientific article; zbMATH DE number 4021127 (Why is no real title available?)
• The incomputable
• Secretive interaction. Players and strategies
• Constructivity conditions on immune sets
• Resource restricted computability theoretic learning: Illustrative topics and problems

This page was built for publication: Directions for computability theory beyond pure mathematical

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