On non-classical theory of computability

MaRDI QIDQ2951118zbMATH OpenFDO

Authors S. A. Nigiyan

Publication date 9 October 2015

Full work available at URL http://mathnet.ru/eng/uzeru/y2015/i1/p52

zbMATH Keywords

\(\beta\)-redex\(\delta\)-redex\(\lambda\)-definabilityarithmetical functioncomputabilityindeterminate value of argumentstrong computability

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20)

Recommendations

• On -definability of arithmetical functions with indeterminate values of arguments
• Conflicting accounts of \(\lambda\)-definability
• On the Definition of Computable Function of a Real Variable
• Theoretical Pearls:Representing ‘undefined’ in lambda calculus
• On -definable functions on ordinals

Cited in

(5)

• On -definability of arithmetical functions with indeterminate values of arguments
• Classical computability and indicators of nondeterminism
• On Non-Detectability of Non-Computability and the Degree of Non-Computability of Solutions of Circuit and Wave Equations on Digital Computers
• Conflicting accounts of \(\lambda\)-definability
• On -definable functions on ordinals

This page was built for publication: On non-classical theory of computability

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