Lacks proof, but theoretically Turing Complete, see: https://ecc-comp.blogspot.com/2018/02/age-of-empires-2-scenario-editor-is.html

Recently demonstrated to not require an infinite playgrid as previously thought. The dev seems to be changing the stack limit to better facilitate Turing machines.

See: https://drive.google.com/file/d/19N0ofHCjhtY_YVGGtVPGyB5PXQtP8pbo/view

See: https://ar5iv.labs.arxiv.org/html/1412.0784?fallback=original

See: https://www.gwern.net/docs/cs/2019-07-15-danielbali-citiesskylineisturingcomplete.html

Maximum of 65535 gates, see: https://calabi-yau.space/blog/doom.html

See: https://imgur.com/a/tVB9xOx

See: https://twitter.com/Habbo/status/1325785673304043522

See: https://www.youtube.com/watch?v=yMnOEgbm2fE

See: https://www.youtube.com/watch?v=13GOFa1C4e4

Stand-in for physical card game, see: https://ar5iv.labs.arxiv.org/html/1904.09828?fallback=original

See: https://hackernoon.com/beyond-esolangs-6-things-that-are-unintentionally-turing-complete-60ab1e1b50f9

Infinite puzzles function as programs for solvers which are, in turn, Turing Complete. https://web.mat.bham.ac.uk/R.W.Kaye/minesw/infmsw.pdf

See: https://www.rockpapershotgun.com/opus-magnum-player-makes-computer

Fringe, but the game logic itself is Turing Complete in that the player can write assembly code through their inventory. See: http://aurellem.org/vba-clojure/html/total-control.html

See: https://ar5iv.labs.arxiv.org/html/2002.05131?fallback=original

Might only be theoretical at present, see: https://www.reddit.com/r/SatisfactoryGame/comments/wm9kni/satisfactory_is_functionally_complete_working/ https://www.reddit.com/r/SatisfactoryGame/comments/er0q03/satisfactory_is_turing_complete_and_i_will_build/

See: https://www.youtube.com/watch?v=BGLWE6S68b0

See: https://www.youtube.com/watch?v=EzzLzUCRmBw

Kind of, sort of, not really. Arbitrary code injection via memory exploit. See: https://arstechnica.com/gaming/2014/01/how-an-emulator-fueled-robot-reprogrammed-super-mario-world-on-the-fly/