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

Discussion Overview

The discussion centers on the concept of the numerical domain of an algorithm, particularly in the context of programming languages and specific instructions like "Go To". Participants explore how to define the numerical domain for various algorithmic constructs and seek clarification on the applicability of this concept across different programming paradigms.

Discussion Character

  • Exploratory, Technical explanation, Conceptual clarification, Debate/contested

Main Points Raised

  • One participant defines the numerical domain of an algorithm as the set of natural numbers that, when input to the algorithm, result in termination and output.
  • Another participant references Fortran 77's "computed" and "assigned" GO TO statements, suggesting that these can be viewed as functions mapping sets of labels and natural numbers.
  • A follow-up question is posed regarding whether each instruction in a programming language can be considered a function of some numeric set, extending the discussion beyond just "Go To".
  • One participant expresses skepticism about the relevance of "Go To" in modern programming languages, implying that the original definition may not apply as intended.

Areas of Agreement / Disagreement

Participants have not reached a consensus on how to universally define the numerical domain for all algorithmic constructs, and there are differing views on the relevance of "Go To" in contemporary programming.

Contextual Notes

The discussion includes assumptions about the definitions of algorithms and programming constructs that may not be universally accepted. The applicability of the numerical domain concept to various programming languages and constructs remains unresolved.

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