If you had infinite space and parts, would Turing Tumble be turing complete?
This has been discussed in Proof of Turing Completeness? - #36 by Patricia, resulting in the formal proof viewable at [2110.09343] Turing Tumble is Turing-Complete
Here is the link to the published article in Theoretical Computer Science: https://drive.google.com/file/d/1k0Pu9M89EvT3uk7KTYxnwaZbA212o55k/view?pli=1