Inhibitor Petri Net, which performs any given Turing machine

Authors

  • D. A. Zaitsev професор Міжнародного гуманітарного університету, Україна, Одеса, Ukraine

Abstract

The inhibitor Petri net with a fixed structure that executes an arbitrary given Turing machine was constructed. The tape of the Turing machine, its program and states are encoded by the marking of 10 dedicated places of the Petri net. The rules of Turing machine work are encoded by a single control flow within the inhibitor Petri net, which is composed of the sequence operators, branching, and cycle. Subnets which implement arithmetic, comparison and copying operations are used.

Author Biography

D. A. Zaitsev, професор Міжнародного гуманітарного університету, Україна, Одеса

Зайцев Дмитро Анатолійович,

доктор технічних наук, професор Міжнародного гуманітарного університету, Україна, Одеса

Downloads

Published

2012-06-27

Issue

No. 2 (2012)

Section

Progressive information technologies, high-efficiency computer systems

License

This is an open access journal which means that all content is freely available without charge to the user or his/her institution. Users are allowed to read, download, copy, distribute, print, search, or link to the full texts of the articles in this journal without asking prior permission from the publisher or the author. This is in accordance with the BOAI definition of open access.