Talk:256
The page is incomplete, as I had something come up. However, 256 uses the instructions it has to create new functions. I'll complete this page now. --Areallycoolusername (talk) 21:48, 2 August 2019 (UTC)
- This might take a while, as I have to complete the page in parts. Areallycoolusername (talk) 22:41, 2 August 2019 (UTC)
- I have now completed the page. Areallycoolusername (talk) 04:54, 4 August 2019 (UTC)
"Stack-based" but uses variables?
Possibly change terminology on the page, as it uses variables mostly, not a Stack-based system? Unsure. Also the 2 instruction is somewhat unclear, it says "pushes it to the top of the stack", even though what it "really" does it set it to the last defined variable? Also unsure about this, looking for some feedback / info, thanks. Duckologist (talk) 18:32, 20 July 2020 (UTC)
My interpretation would be that variables inhabit the same memory as the stack, and new variables are created from the bottom upwards. I don't know if that's really the intent. If it is, I'd agree it's not really stack-based, since the stack is never read as a stack.I should have read more carefully. It says "When a variable has the command 2 as it's value, it must be separated by a semicolon." I guess that means commands can return values? And the stack is never read at all. Caenbe (talk) 20:41, 20 July 2020 (UTC)
<variable>-- (and ++) is used in code samples but not mentioned in specs?
The ^ / if example uses it in a loop, but rest of the spec fails to mention it? Duckologist (talk) 07:00, 21 July 2020 (UTC)
Why is the article still in the unimplemented category?
On the bottom of the page there is a link to a interpreter. The article should be in the category implemented. Edit: I changed the category. --(this comment by Grs at 20:03, June 5, 2021 UTC; please sign your comments with ~~~~)
category
if theres no explicit proof of turing completeness, then the category should be delete. i will do this unless i'm not allowed to --Yayimhere (talk) 18:35, 24 August 2024 (UTC)
- I looked at the language and am confused – the examples don't seem to match the specification. Based on the examples I'd expect it to be Turing-complete one way or another (probably by implementing some sort of counter machine), but based on the specification I'd expect it not to be. The interpreter doesn't help because the link to it is dead. As it is, the article doesn't seem to contain enough information to determine whether it's Turing-complete or not (which is a pretty interesting variation of "unknown computational class"!) --ais523 23:42, 24 August 2024 (UTC)