Talk:1

Computational class

This is actually likely Turing complete since * can both multiply and divide. See counter machine. stkptr (talk) 04:34, 7 March 2025 (UTC)

The arguments for * seem to be in an inconvenient order for counter machines so it can't be that direct, but I think it's still possible to make some kind of Turing-complete construction. -PkmnQ (talk) 08:46, 7 March 2025 (UTC)

On thinking about it more, it's hard to say. I retract my "likely." In order for the one-counter multiplicative machine to work, division not just modulo is needed. If somehow top swaps could be done then 2-counter machines could potentially be done. I would target that instead. stkptr (talk) 20:00, 7 March 2025 (UTC)