The Construction and Computation of for-loop Programs for SCMPDS1

نویسندگان

  • Jing-Chao Chen
  • Piotr Rudnicki
چکیده

This article defines two for-loop statements for SCMPDS. One is called for-up, which corresponds to “for (i=x; i<0; i+=n) S” in C language. Another is called fordown, which corresponds to “for (i=x; i>0; i-=n) S”. Here, we do not present their unconditional halting (called parahalting) property, because we have not found that there exists a useful for-loop statement with unconditional halting, and the proof of unconditional halting is much simpler than that of conditional halting. It is hard to formalize all halting conditions, but some cases can be formalized. We choose loop invariants as halting conditions to prove halting problem of for-up/down statements. When some variables (except the loop control variable) keep undestroyed on a set for the loop invariant, and the loop body is halting for this condition, the corresponding for-up/down is halting and computable under this condition. The computation of for-loop statements can be realized by evaluating its body. At the end of the article, we verify for-down statements by two examples for summing.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Construction and Computation of While-Loop Programs for SCMPDS1

This article defines two while-loop statements on SCMPDS, i.e. “while<0” and “while>0”, which resemble the while-statements of the common high language such as C. We previously presented a number of tricks for computing while-loop statements on SCMFSA, e.g. step-while. However, after inspecting a few realistic examples, we found that they are neither very useful nor of generalization. To cover ...

متن کامل

Computation of Two Consecutive Program Blocks for SCMPDS1

In this article, a program block without halting instructions is called NoStopCode 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 blo...

متن کامل

The Construction and Computation of While-Loop Programs for SCMPDS

This article defines two while-loop statements on SCMPDS, i.e. “while<0” and “while>0”, which resemble the while-statements of the common high language such as C. We previously presented a number of tricks for computing while-loop statements on SCMFSA, e.g. step-while. However, after inspecting a few realistic examples, we found that they are neither very useful nor of generalization. To cover ...

متن کامل

Automatic graph construction of periodic open tubulene ((5,6,7)3) and computation of its Wiener, PI, and Szeged indices

The mathematical properties of nano molecules are an interesting branch of nanoscience for researches nowadays. The periodic open single wall tubulene is one of the nano molecules which is built up from two caps and a distancing nanotube/neck. We discuss how to automatically construct the graph of this molecule and plot the graph by spring layout algorithm in graphviz and netwrokx packages. The...

متن کامل

Comparison of Diagnostic Value of Cast Analyzer X Iranian Software versus Curve Expert Software for Arch Form Construction based on Mathematical Models

  Objective: For the assessment of primary arch form, different methods have been used including qualitative classifications, inter-canine and inter-molar widths and quantitative and numerical methods using mathematical models. The purpose of this study was to compare the validity and reliability of Cast Analyzer X Iranian software with those of Curve Expert Professional version 1.1 for arch fo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999