a machine type

Anyone familiar with the idea of trying to describe a working
functional machine able to be any? like where it's be a machine
working the way of a software code loop with the problem of being in
the middle and then to the outside as how the machine can move?

I think I know a way there is to describe a machine that works this
way...

say on a checkers board you have checker pieces, and say each checker
piece is paired with another.
now all checker pieces are pairs.
the way said, try to make one piece able to move... but you have to
move the other it's a pair with at the same time.
the board is full, there's no free spaces to move to.
so to make a piece move with it's paired piece, find where it can go
where there's another pair that can move, that pair can move where
another pair can move, and so on... where the last pair to move goes
where the first pair left.
each time you move a pair, they are not the same pair anymore once
they've moved, each of the pair is now a pair with the piece that left
where they went to make a new pair of them. this is key in figuring
out the only way it can work so a piece can move at all.

so knowing no first move you can make because there isn't any specific
move to know, find the pair to be able to move the way where they move
to another pair where each of the pair is now another pair with the
one they move to, they move to a pair that's together. now first pair
to move to another pair, is now not the same pair, but each a pair
with each of the other pair.

so move and do that, but at the same time when you get a piece of the
first pair where it goes and the other pair moved, as a new pair now
it can't stay there because it has to move again because of how at the
same time something is making the other of the pair move. right? maybe
that part is hard to see. It's the only way to figure it can move in
any way at all.

so it's like the last move has to be known before the first move can
be made, because the first move that can be made is where something
can move next, but what can move next is what carries on to the last
move that can move where the first pair moved from. it's a recursive
type of problem to figure out how to move a pair.

where a pair can move is where it goes to another pair that at the
same time is moving away making an occupancy, but when you get there
and you're a new pair with the piece that moves from where you get to,
it's not to think staying can work because now something needs the
pair you are now to move.

it's like so where you can never have it so you stop moving until all
the move is complete. but nowhere in the middle, or at first or last,
can you know how to make it work to move because the beginning is like
knowing the end of how to move.

what's interesting though is how pairs that figure themselves to be
able to move are not all the pairs but some, but that some other pairs
that figure out a way to move are the same pairs as others that figure
out another way.

and each time a pair makes a move it's all the way to where the place
they leave has something come, but that had to be before you can move
in the first place in idea of the problem it is because that's where
something can move to finally get around to the last move where you
leave, but leave where you can because you find what comes where you
leave at first. each time a pair is moved depending on how moving
pairs are said together is to reorganize how pairs are together, but
to keep moving the same pairs is to find the same place they were in
to begin with but alot of other ways too depending on which of the
pairs together you try to move, if you say the pairs together are the
pairs that given one pair are the ones that move at the same time too.

isn't it fair to call how they behave any machine?

there's a few things you can say like given how they're arranged pick
a few pairs for how they're organized and see how every way you can
move them makes a few more pairs reorganized for how you move them?
it's like pairs can setup in any way where for any way they are
organized is for any way other pairs are organized.

it's like saying for every combination of a number, there's another
combination but not linear association.

so don't they describe any machine there can be ? like don't they
describe working with a behavior that can be how any possible machine
works?

you can see how it looks like a machine when you take a pair and
figure how it can be moved, like say one moves, but it goes where
something else moves, and it moves where something else moves, but
then something moves to where the first one left. so say just one of
these that work around to move, but then say all that do. say all
together like the ones that move around in a way but the others that
move around in a way, you can see importantly enough for how it's a
machine that they use the same pairs starting from somewhere else to
move as how you can move somewhere else.

isn't that any machine there can be? I mean like a functional machine
to work like gears but not like gears where you have to be in the
middle of it working to be on the outside then the otherside again.
Like if you thought of code working as a real machine doing what a
'for loop' does, it has to be a machine that is in the middle of the
'for loop' to be to the beginning again, but then again through it but
not to the beginning but through the end.
But as a machine that actually moves the way this would have to?

Don't moving pairs represent any machine there can be?

See them though the way you put together pairs that move with others
that can move the way they can move, like one moves the other to move
the other. but then others that do that do that to another that works
it's own way. see it though the way it's a machine that can work like
a machine can for what it is to work that way, because it's to see
what a loop has to be for example.

I find something special about how if you move a pair and look at it
as a machine again, there's something to notice.

.

Relevant Pages

  • way of describing a machine
    ... say on a checkers board you have checker pieces, ... it's like so where you can never have it so you stop moving until all ... I mean like a functional machine ... 'for loop' does, it has to be a machine that is in the middle of the ...
    (comp.theory)
  • Re: working conditional machine
    ... like where it's being a machine working the way of having a loop with ... so as a real machine though, that works the way that would have to as ... say on a checkers board you have checker pieces, ... it's like so where you can never have it so you stop moving until all ...
    (comp.programming)
  • Re: describing a machine
    ... like where it's being a machine working the way of having a loop with ... so as a real machine though, that works the way that would have to as ... say on a checkers board you have checker pieces, ... it's like so where you can never have it so you stop moving until all ...
    (comp.theory)
  • Re: describing a machine
    ... like where it's being a machine working the way of having a loop with ... so as a real machine though, that works the way that would have to as ... say on a checkers board you have checker pieces, ... it's like so where you can never have it so you stop moving until all ...
    (comp.theory)
  • Re: moving pairs
    ... draw somehow how each can be solved with all that have to move ... just be moving one that solves. ... what won't loop on it's own unless the whole machine's set position is ... a whole machine that altogether has one position to be in, ...
    (comp.lang.c)