Izbrane teme sodobne fizike in matematike

Diagrami invariant za Turingove stroje

Diagrami invariant so bili uvedeni z namenom lažje zasnove dokazljivo pravilnih programov. V tem članku bodo uporabljeni za zasnovo in dokazovanje pravilnosti Turingovih strojev. Najprej bodo definirani splošni diagrami invariant ter njihova semantika in programska logika. Ti bodo uporabljeni za sestavo diagramov invariant za Turingove stroje. Za lažje dokazovanje bo uvedeno še nekaj notacije in pravil za sklepanje z njimi. Na koncu bodo uporabljeni na primeru.

Invariant diagrams for Turing machines

Invariant diagrams were created to facilitate the design of provably correct programs. In this paper, they will be used to design and prove the correctness of Turing machines. Firstly, general invariant diagrams, their semantics, and their program logic will be defined. They will be used to construct invariant diagrams for Turing machines. To facilitate the proofs, some notation and rules will be introduced for reasoning with them. Finally, their application will be demonstrated on an example.