I am interested in knowing the Chomsky hierarchy of a particular computation model. Also, I would like to know if it is equivalent to Finite State Machine or is Turing complete.
This computation model is called marbles and circles. For this model, the variables take a constant word size w which matches the problem. A marble contains a unique key and a value. A marble can not contain another marble. A circle contains a unique key and a value. A circle can intersect another circle or be completely inscribed by another circle. The marbles only exist once if they overlap the circles. This is shown by the marbles on the intersection of the two circles.
There are computer operations in this model. The operations take a constant time and constant space. The operations are below. The rest of operations like increment a loop counter are free (zero cost).
add marble(circle) remove marble(circle, marble) move marbles(marble, from circle, to circle) remove marble (marble, circle) add circle (overlaps, inside of) remove circle(circle)
- circles are a countably infinite set
- axiom of countable choice is allowed, but not the whole axiom of choice
- marbles do Not contain other marbles
- rest of software operations such as loop counter increment is free (zero cost)