Formalism
Systemic computation has been shown to be Turing Complete. It also has a formal calculus which is being developed and enhanced in parallel to the creation of the architectures and programs in order to enable a concise description of a systemic program or model. The current (simplified) version of the calculus notation is shown below. This version omits the notation for partial membership of scopes; note that the notation is subject to change.
page revision: 1, last edited: 18 Nov 2009 17:43