Volume 11, 1999

University of Bialystok

Copyright (c) 1999 Association of Mizar Users

**Jing-Chao Chen**- Shanghai Jiaotong University

- In this article, a program block without halting instructions is called No-StopCode program block. If a program consists of two blocks, where the first block is parahalting (i.e. halt for all states) and No-StopCode, and the second block is parahalting and shiftable, it can be computed by combining the computation results of the two blocks. For a program which consists of a instruction and a block, we obtain a similar conclusion. For a large amount of programs, the computation method given in the article is useful, but it is not suitable to recursive programs.

This research is partially supported by the National Natural Science Foundation of China Grant No. 69873033.

- Preliminaries
- Non Halting Instructions and Parahalting Instructions
- Computation of two Consecutive Program Blocks
- Computation of the Program Consisting of a Instruction and a Block

- [1]
Grzegorz Bancerek.
Cardinal numbers.
*Journal of Formalized Mathematics*, 1, 1989. - [2]
Grzegorz Bancerek.
The fundamental properties of natural numbers.
*Journal of Formalized Mathematics*, 1, 1989. - [3]
Grzegorz Bancerek and Piotr Rudnicki.
Development of terminology for \bf scm.
*Journal of Formalized Mathematics*, 5, 1993. - [4]
Grzegorz Bancerek and Andrzej Trybulec.
Miscellaneous facts about functions.
*Journal of Formalized Mathematics*, 8, 1996. - [5]
Czeslaw Bylinski.
Functions and their basic properties.
*Journal of Formalized Mathematics*, 1, 1989. - [6]
Czeslaw Bylinski.
The modification of a function by a function and the iteration of the composition of a function.
*Journal of Formalized Mathematics*, 2, 1990. - [7]
Jing-Chao Chen.
Computation and program shift in the SCMPDS computer.
*Journal of Formalized Mathematics*, 11, 1999. - [8]
Jing-Chao Chen.
The construction and shiftability of program blocks for SCMPDS.
*Journal of Formalized Mathematics*, 11, 1999. - [9]
Jing-Chao Chen.
The SCMPDS computer and the basic semantics of its instructions.
*Journal of Formalized Mathematics*, 11, 1999. - [10]
Yatsuka Nakamura and Andrzej Trybulec.
A mathematical model of CPU.
*Journal of Formalized Mathematics*, 4, 1992. - [11]
Yatsuka Nakamura and Andrzej Trybulec.
On a mathematical model of programs.
*Journal of Formalized Mathematics*, 4, 1992. - [12]
Yasushi Tanaka.
On the decomposition of the states of SCM.
*Journal of Formalized Mathematics*, 5, 1993. - [13]
Andrzej Trybulec.
Tarski Grothendieck set theory.
*Journal of Formalized Mathematics*, Axiomatics, 1989. - [14]
Andrzej Trybulec and Yatsuka Nakamura.
Some remarks on the simple concrete model of computer.
*Journal of Formalized Mathematics*, 5, 1993. - [15]
Michal J. Trybulec.
Integers.
*Journal of Formalized Mathematics*, 2, 1990. - [16]
Wojciech A. Trybulec.
Groups.
*Journal of Formalized Mathematics*, 2, 1990. - [17]
Edmund Woronowicz.
Relations and their basic properties.
*Journal of Formalized Mathematics*, 1, 1989.

[ Download a postscript version, MML identifier index, Mizar home page]