User talk:FortyTwo

From Esolang
Jump to navigation Jump to search

Flooding Waterfall Model is Turing-complete

I just proved Flooding Waterfall Model Turing-complete (and have an explicit construction that lets you compile into it from the original Waterfall Model, plus an interpreter to test out the resulting programs). However, I couldn't find a way to contact you to let you know (I can't post on MTGSalvation without a Twitch account, which I don't have), so my best attempt was to throw up the Orange Bar Of Doom and hope that you happened to visit this wiki for some reason or another. (Just to avoid any confusion: this is me posting as a regular user, not as an admin.)

It probably requires more counters than the non-flooding version does, but it should still fit well within the number of available creature types (less than 100 has already been proven – I don't know where the limit is but it's probably substantially lower). --ais523 07:51, 13 September 2023 (UTC)