ON NON-CLASSICAL THEORY OF COMPUTABILITY
DOI:
https://doi.org/10.46991/PSYU:A/2015.49.1.052Keywords:
arithmetical function, indeterminate value of argument, computability, strong computability, λ-definability, β-redex, δ-redexAbstract
Definition of arithmetical functions with indeterminate values of arguments is given. Notions of computability, strong computability and λ-definability for such functions are introduced. Monotonicity and computability of every λ-definable arithmetical function with indeterminate values of arguments is proved. It is proved that every computable, naturally extended arithmetical function with indeterminate values of arguments is λ-definable. It is also proved that there exist strong computable, monotonic arithmetical functions with indeterminate values of arguments, which are not λ-definable. The δ-redex problem for strong computable, monotonic arithmetical functions with indeterminate values of arguments is defined. It is proved that there exist strong computable, λ-definable arithmetical functions with indeterminate values of arguments, for which the δ-redex problem is unsolvable.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2015 Proceedings of the YSU
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.