Talk:1=0+1

I think a potentially interesting variant of 1=0+1 is one where each line must be "true". So the program:

0=0
1=1
2=1+1

would be valid, but a program like:

0=0
1=1+1

would not. When evaluating the Right hand side with the standard values of the numbers it must be true. --Yayimhere2(school) (talk) 13:56, 15 January 2026 (UTC)

Sounds interesting, you can create an esolang like this named "Restricted 1=0+1" or similar names. --None1 (Nope.) 12:20, 16 January 2026 (UTC)

Maybe, I could ironically name it 1≠0+1 lol --Yayimhere2(school) (talk) 12:37, 16 January 2026 (UTC)

Ive found an issue. No variable can increase, because it can never reference itself! perhaps, you can do like:

x=y<sub>1</sub>+y<sub>2</sub>+...y<sub>n</sub>(-z)

Then the equation y1+y2+...yn-z must be true. But idk --Yayimhere2(school) (talk) 12:53, 16 January 2026 (UTC)

OMG! I've been thinking this idea for several days and never thought of this issue! -None1 (Nope.) 12:26, 17 January 2026 (UTC)

I suggest tweaking the idea a bit to solve the issue: Initially, variable 0 stores n-1, variable 1 stores n-2,..., variable n stores 0, allowing more useful programs like this one:

0=0+0
1=1

Computes powers of 2. --None1 (Nope.) 10:38, 18 January 2026 (UTC)

Thats cool I guess! Though -1+-1≠-1. I think perhaps your model would work with multiplication! --Yayimhere2(school) (talk) 17:23, 18 January 2026 (UTC)