User talk:Gapples2

Thanks

Hi, just wanted to say thanks for your interest in Bunnybell, your questions were really helpful as I considered the language design. It's a bit more C like now, and I'm putting the finishing touches on the docs at the moment. PixelatedStarfish (talk) 13:56, 12 July 2022 (UTC)

Congratulations, and thanks

Congratulations on proving Queuenanimous Turing complete! I checked your page and saw you also prove the class of languages. Your note on Stacks of Queues convinced me to take another look at the tag system translation I was working on but nearly abandoned due to issues sending data upwards. Good luck on further proofs! stkptr (talk) 17:30, 28 April 2025 (UTC)

Smolder totalness

is Smolder really total? I understand the notion that you come by, but wouldn't making some contraption that repeats infinitely across the plane allow data to be reused or transferred? I'm comparing it to Burnlike here; there could be a way to make something like Rule 110 via some contraption, allowing Smolder to be TC by reduction —aadenboy (talk|contribs)

When I made my proof I didn't consider the ability to make slight modifications after the source program had been infinitely tiled (which is what Burnlike does to compute Rule 110). I'll clarify my current proof and look into potential ways to simulate Rule 110. Gapples2 (talk) 15:46, 2 June 2025 (UTC)