What is the Numerical Domain of an Algorithm and How is it Determined?

  • Context: MHB 
  • Thread starter Thread starter agapito
  • Start date Start date
  • Tags Tags
    Domain Numerical
Click For Summary
SUMMARY

The numerical domain of an algorithm is defined as the set of natural numbers that, when input into the algorithm, result in termination and an output. According to Smith's "An Introduction to Goedel's Theorems," any well-formed formula (wff) of a programming language, such as C++, can be considered an algorithm with a numerical domain. The discussion highlights the classification of Fortran 77's GO TO statements, including "computed," "assigned," and "unconditional," each representing different functions within their respective domains. The inquiry revolves around whether all instructions in programming languages can be viewed as functions of numeric sets.

PREREQUISITES
  • Understanding of algorithmic concepts and definitions
  • Familiarity with programming languages, particularly C++ and Fortran 77
  • Basic knowledge of mathematical functions and domains
  • Awareness of well-formed formulas (wff) in programming
NEXT STEPS
  • Research the concept of well-formed formulas (wff) in programming languages
  • Explore the classification and usage of GO TO statements in Fortran 77
  • Study the implications of algorithm termination and output in computational theory
  • Investigate the numerical domains of various programming constructs across different languages
USEFUL FOR

Computer scientists, software engineers, and students of programming languages seeking to understand the theoretical foundations of algorithms and their numerical domains.

agapito
Messages
46
Reaction score
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.
 
Technology news on Phys.org
Logic is not my area of expertise, but your question made me think of Fortran 77's "computed" and "assigned" GO TO statements, https://www.fortran.com/F77_std/rjcnf0001-sh-11.html for some documentation on the (now obsolete) 77 standard.

A "computed" GO TO is then a function defined on $\{1,\ldots,n\}$ mapping to the set of labels $\{s_1,\ldots,s_n\}$.
An "assigned" GO TO is a function from the set of labels to itself.
Finally, an unconditional GO TO is a constant function defined on $\mathbb{N}$.

Maybe this helps you in your thoughts?
 
Last edited:
Krylov said:
Logic is not my area of expertise, but your question made me think of Fortran 77's "computed" and "assigned" GO TO statements, https://www.fortran.com/F77_std/rjcnf0001-sh-11.html for some documentation on the (now obsolete) 77 standard.

A "computed" GO TO is then a function defined on $\{1,\ldots,n\}$ mapping to the set of labels $\{s_1,\ldots,s_n\}$.
An "assigned" GO TO is a function from the set of labels to itself.
Finally, an unconditional GO TO is a constant function defined on $\mathbb{N}$.

Maybe this helps you in your thoughts?

Thanks. OK in the case of GO TO we can say that the set {1,2,...n} is the algorithmic domain of the instruction. The question, then, is whether each instruction (wff) of the programming language can be similarly considered a function of some numeric set? Thanks again for your help.
 
It's quite possible that the author was not thinking of "Go To" since no modern language uses that.
 

Similar threads

  • · Replies 8 ·
Replies
8
Views
4K
  • · Replies 30 ·
2
Replies
30
Views
6K
  • · Replies 17 ·
Replies
17
Views
2K
  • · Replies 13 ·
Replies
13
Views
3K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
Replies
29
Views
5K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K