On 2022-05-23 13:38, nichol...@gmail.com
> Pavel, are you searching for these just by mark count? Have you found
> any that run longer but with fewer marks?
> In the past the longest-running machines have also had the most marks,
> so there hasn't been a need to distinguish.
just marks. computing steps usually requires "math" one level up from
what you use in accelerating rules / nonhalt proofs => most of the time
it lags behind in my simulator.
but to be precise, to this day i have tested uncategorized machines with
1 undefined transition from my old logs, as it was the most promising
place to look & i didn't have to spend time implementing search
infrastructure. => as soon as i debugged my implenentation, there were
only a few new numbers to see.
but it was good stress testing - this code should definitely handle a
full tm6 scan from single modern machine in reasonable time (when
// in some places, including here, i see BB function used as the max
number of steps, but it's defined as the max number of ones. i was not
aware of this schism until Shawn announced his record. when did this