i think that computer or turing machines are just electronic mechanical abacus

so my first try was not good it followed all posible orders for the abacus while we need just the counting ones

so what im programming now is a mecahnical abacus with 4 posible commands which in combination i think cover all posible algorythms with teh commands in the right combination:

add one, substract one, shift first row to last and shift last row to first

i really dont understand how turing fell in the non halt problem and remain afterwards

with just 4 posible commands and the non halt problem i can test all posible commands till i get the desired result and like that give the computer a result and it will find me by brute force the algorithm that produces that sequence

i plan to test it on enigama code