SCMPDS Is Not Standard
نویسندگان
چکیده
In this paper r, s are real numbers. We now state several propositions: (1) 0 ¬ r + |r|. (2) 0 ¬ −r + |r|. (3) If |r| = |s|, then r = s or r = −s. (4) For all natural numbers i, j such that i < j and i 6= 0 holds i j is not integer. (5) {2 · k; k ranges over natural numbers: k > 1} is infinite. (6) For every function f and for all sets a, b, c such that a 6= c holds (f+·(a7−→ . b))(c) = f(c). (7) For every function f and for all sets a, b, c, d such that a 6= b holds (f+·[a 7−→ c, b 7−→ d])(a) = c and (f+·[a 7−→ c, b 7−→ d])(b) = d.
منابع مشابه
The SCMPDS Computer and the Basic Semantics of its Instructions
The article defines the SCMPDS computer and its instructions. The SCMPDS computer consists of such instructions as conventional arithmetic, ”goto”, ”return” and ”save instruction-counter” (”saveIC” for short). The address used in the ”goto” instruction is an offset value rather than a pointer in the standard sense. Thus, we don’t define halting instruction directly but define it by ”goto 0” ins...
متن کاملThe SCMPDS Computer and the Basic Semantics of its Instructions1
The article defines the SCMPDS computer and its instructions. The SCMPDS computer consists of such instructions as conventional arithmetic, “goto”, “return” and “save instruction-counter” (“saveIC” for short). The address used in the “goto” instruction is an offset value rather than a pointer in the standard sense. Thus, we don’t define halting instruction directly but define it by “goto 0” ins...
متن کاملQuick Sort on SCMPDS
This means we cannot justify the correctness of the “Partition” subroutine by the Hoare’s axiom on program verification. This article is organized as follows. First, we present several fundamental properties of “while” program and finite sequence. Second, we define the “Partition” subroutine on SCMPDS, the task of which is to split a sequence into a smaller and a larger subsequence. The definit...
متن کاملComputation and Program Shift in the SCMPDS Computer1
A finite partial state is said to be autonomic if the computation results in any two states containing it are same on its domain. On the basis of this definition, this article presents some computation results about autonomic finite partial states of the SCMPDS computer. Because the instructions of the SCMPDS computer are more complicated than those of the SCMFSA computer, the results given by ...
متن کاملRecursive Euclide Algorithm 1
The earlier SCM computer did not contain recursive function, so Trybulec and Nakamura proved the correctness of the Euclid’s algorithm only by way of an iterative program. However, the recursive method is a very important programming method, furthermore, for some algorithms, for example Quicksort, only by employing a recursive method (note push-down stack is essentially also a recursive method)...
متن کاملInsert Sort on Scmpds
The goal of this article is to examine the effectiveness of “forloop” and “while-loop” statements on SCMPDS by insert sort. In this article, first of all, we present an approach to compute the execution result of “for-loop” program by “loop-invariant”, based on Hoare’s axioms for program verification. Secondly, we extend the fundamental properties of the finite sequence and complex instructions...
متن کامل