However, in use it provides the operational convenience and pedagogical advantage of concentrating on the high level of detail (essentially, no much detail at all) of why a construction does what we say it does -or why a mathematical definition produces a computable function- without overdoing the mathematics in the process. We note that at the present state of our understanding of the concept of “algorithm” or “algorithmic process”, there is no known way to define -via a pseudo-program of sorts- an “intuitively computable” function on the natural numbers, which is outside of \(\)) with imprecise informal ones (“algorithm”, “computable function”). In particular, it can be “programmed” as a URM. Every informal algorithm (pseudo-program) that we propose for the computation of a function can be implemented in each of the known mathematical models of computation.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |