Im trying to simulate a turing machine in C++... The problem isnt related to the language... The problem is about the virtual turing machine itself, and that is why Im posting here since I dont know where to post.

The VTM can go right, left, write to the current cell(which is represented by a single byte on the memory), read the current cell and compare the current cell to some value, execute some action if it is evaluated to true or false, saving states and change states. It is everything acomplished by a "pseudo language" I created for the program, which will interpret it "on the fly"

But the problem is that Im not too sure about how a turing machine works, meaning that I don't know what to add to the program and the pseudo language anymore... For example those "machine states", they work more like labels... When you save a state, you're actually saving a position on the pseudo code you can call from any other point, much like a "goto", except for the fact that it is interpreted on the fly. Then we have the pseudo language compare instrutions... I dont even know if a turing machine can compare values... The real problem here is that I dont know turing machines very well... I have no idea how states work, if it is like goto instructions or something else... Finally, the "tape" is represented by contiguous memory locations...

Lets go to the main question... Is it finished? Can it be considered a turing machine? Or is it away from being a turing machine? If Im right so far, what should I do to finish it?

Again it has nothing to do with C++, I know how to use it to do what I want, I just wanna know now what to do next...