An abstract machine M_sis for slow intelligence systems is defined as:

M_sis = { P, S, Po, cycle1, cycle2, ., cyclen}

Where P is the problem space, S the solution space, Po the initial problem set and cycle1, cycle2, ., cyclen the computation cycles.

The problem space P is a nonempty, enumerable set of problem elements p1, p2, ., pm. A problem set Pk is a finite subset of P. At least some of the problem elements in the problem space are also the solution elements. Therefore the solution space S is a nonempty subset of the problem space P. A solution set Sj is a finite subset of S.