Dear colleagues:

It is shown that Minsky Counter Machine can simulate a Turing machine , for two counters can simulate a stack (a half tape in Turing machine). If 1 pushed in the stack, then double the counter plus 1; if 0 is pushed then double the counter. When multipliers and reminders in many steps are mixed in one counter, how to discriminate which step of a pushing? Where I can find the introduction to Minsky Counter Machine in more detail than Wikipedia ?   

Similar questions and discussions