- #1
agapito
- 49
- 0
Hi everyone. My book (Smith's "An Introduction to Goedel's Theorems") defines the numerical domain of an algorithm as the set of naturals that, when input individually to the algorithm, result in its "working", that is to terminate and output some result. In the book it is also stated that any wff of a programming language (e. g. C++) can be considered an algorithm, having a numerical domain.
I'm not clear about how an instruction such as "Go To" can be considered an algorithm, or if it is, then how does one determine its numerical domain.
Can someone please explain this? All help greatly appreciated.
I'm not clear about how an instruction such as "Go To" can be considered an algorithm, or if it is, then how does one determine its numerical domain.
Can someone please explain this? All help greatly appreciated.