The Church–Turing thesis deals with computing functions that are described by a list of formal, mathematical rules or sequences of event-driven actions such as modeling, simulation, business workflows, etc. All algorithms that are Turing computable fall within the boundaries of the Church–Turing thesis. There are two paths to pushing the boundaries. The first is to address the limitation in the clause “ignoring resource limitations”. The second is to search for computing models that solve problems that no ordinary Turing machine can solve using superrecursive algorithms. We argue that “structural machines” provide a new solution to managing both without disrupting the computation itself.
展开▼