Petri Net Computers
摘要
Weak and strong Petri net computers are introduced as two different means of calculating functions from vectors of natural numbers to natural numbers. Their capabilities as well as their similarities and differences are explored. It is shown that even the fast-growing Ackermann function is Petri net computable, leading to extremely large state spaces.