Talk:(1) Grace sent you a message

Yeah thanks a lot. My browser thinks I've got one notification now, when I don't. Hey, that's a very good meme! (Talk) 00:30, 25 May 2020 (UTC) ;P

Please implement it, we wanna use it By Hello World Gang 02:28, 23 December 2022 (UTC)

I created an interpreter, but it still needs improving. Any bugs are welcome to be fixed Pipipipipiale (talk) 17:23, 17 April 2023 (UTC)

Hello, Pipipipipiale. It seems like you misunderstood the language specification. Your interpreter randomly selects one of the two programs and executes it. That's not how this programming language works. The specification says "If there is a sequence that leads to the actual user input, then interpreter outputs 1 and halts." It means that you are supposed to create the list of all possible combinations (lists) of first and second program and then iteratively check all of them to see if some of them leads to the actual input. --Hakerh400 (talk) 17:46, 17 April 2023 (UTC)

I can see why it's unimplemented! Pipipipipiale (talk) 18:12, 17 April 2023 (UTC)

So I implemented it, it's horrifyingly slow, and the number of states doubles every step. I absolutely can see why it's unimplemented. Oh, and I don't know if it works. Pipipipipiale (talk) 21:18, 17 April 2023 (UTC)

That's much better. There are two suggestions. First, instead of terminating the entire program if an error occurs (the pointer goes outside of the memory in a BF program), you should simply skip that particular BF program and go on. Second, if a BF program does not halt, you should skip it instead of running it forever. Since each BF program is a LBA, you can determine whether it halts by simply running it for $n\cdot 256^{m}$ steps, where $n$ is the length of that program's source code and $m$ is the memory size in that particular execution (you would need to use big integers if you want to implement it in JavaScript). If the program doesn't halt for that many steps, it won't halt ever, so you can skip it and go on. Once you implement these two suggestions, feel free to add your implementation to the article page. --Hakerh400 (talk) 11:06, 4 May 2023 (UTC)

Computational class

I find it very plausible that this language is Turing-complete, but it's not entirely obvious to me that it is. Does anyone have a proof or short explanation to back up that claim? --Chris Pressey (talk) 15:40, 3 June 2020 (UTC)

Added TC proof sketch. --Hakerh400 (talk) 23:39, 3 June 2020 (UTC)