We are currently working on new rules for what content should and shouldn't be allowed on this website, and are looking for feedback! See Esolang:2026 topicality proposal to view and give feedback on the current draft.
Talk:VoidPtr
Jump to navigation
Jump to search
the brainfuck interpreter can only access 256 cells, so it doest seem to be turing complete --dragoneater67 talk contribs (mobile) 20:00, 1 September 2026 (UTC)
But VoidPtr can! The BF interpreter is just an example. Basilisk (talk)Basilisk
- can you access an infinite amount of cells in a program of finite size? --dragoneater67 talk contribs (mobile) 05:57, 2 September 2026 (UTC)
- If you implement system call $6 and $7 to address a theoretical n byte address, yes. System call $4 can be called in an infinite loop to allocate infinite memory and access it in the same loop. Therefore accessing infinite cells in a finite program.
- The memory model itself is unbounded. Basilisk (talk) 12:47, 2 September 2026 (UTC)Basilisk
- So, more people claim that I need to prove TC by writing an unbounded BF interpreter. I'll do that once I get the compiler to support spec 1.2. Feel free to try that yourself in the mean time, anyone reading this. The main implementation is linked on the page. Basilisk (talk) 13:06, 2 September 2026 (UTC)Basilisk
- The memory model itself is unbounded. Basilisk (talk) 12:47, 2 September 2026 (UTC)Basilisk