Talk:Arbitrary memory emulation

AME can also be done with prime factorization, like with $A=2^{c_{1}}3^{c_{2}}5^{c_{3}}7^{c_{4}}\cdots$ (see Minsky machine#The section 14.2 Minsky machine), though I'm not sure what the formulas for basic operations would look like, if there are any —aadenboy (talk|contribs) 18:50, 9 January 2026 (UTC)

Huh, this sounds like what I just finished editing at Ring-around-the-Rosie#Branchless:_ɾ. I hadn't noticed this ABE page before, but I have spent a bit of time working with 2-reg Minsky machines, and lately the 1 reg 14.2 versions. This Ring-around-the-Rosie#Branchless:_ɾ idea I had is my latest version of a purely arithmetic TC language. I've only just written this up, but I'll extend my WIP Python interpreter to have an arithmetic only evaluation mode at some point to test the concept further. It's really just 1 reg Minsky machines, but I'm trying to find a convenient notation and evaluation strategy to write and run real programs. Salpynx (talk) 23:02, 5 February 2026 (UTC)

mAME is now documented! —aadenboy (talk|contribs) 16:22, 6 February 2026 (UTC)

hey User:Corbin, can you proofread what I wrote in the Variations section? I'm not sure if I'm using the correct language/notation. —aadenboy (talk|contribs) 21:15, 5 February 2026 (UTC)

What you wrote makes sense to me. I didn't double-check the arithmetic, but it's in the right ballpark. Moreover, the way that you wrote it makes me think of other systems, like the varint encoding used in wikipedia:Protocol Buffers. Corbin (talk) 02:10, 6 February 2026 (UTC)