Yes, the RPI page and work was very much like what you've started!
The problem is these efforts often grow, flourish, and then decay
over 5-10 years (and are often forgotten). I would like to fix that
AND recover the treasure from past efforts and put it on display
with the new work. Soon, I'm going to start a discussion on where
this could be done and how it could be done to guarantee longevity.
One option is GitHub which is well past critical mass and will
likely survive well into the future and will almost certainly have
migration paths to "the next big thing".
Another connection I'd like to make is to the Santa Fe Institute
Applied Complexity effort,
https://www.santafe.edu/applied-complexity/office
and
https://www.complexityexplorer.org,
which was started by some amazing people and is exploring all
aspects of complexity.
There is also Scott Aaronson at UT Austin (who is a member of this
discussion group and helped revive the current interest in all this)
whose thoughts on all this (beyond his recent paper) would be very
useful.
Finally, with the connection between the BB problem (and related
questions) and Collatz-like behavior, we find ourselves intertwining
two problems that students and researchers have been traditionally
directed away from as traps or infinite time sinks! I feel proud to
jump off the edge of the world with everyone involved in this
effort...
Terry J. (Ligocki,
tjli...@gmail.com)
P.S. Pascal and Heiner have some links to past efforts to have
webpages that document some aspects of the BB problem and, in
general, TMs. I haven't had a chance to check those against things
on the
https://bbchallenge.org page(s). I'm going to try and contact
people who worked on the RPI page with the goal of piecing it back
together and going from there...