Re: imaginary halting problem was Re: [spam][crazy][spam] imaginary code resembling trained dissociation

in one possible extreme f() outputs a warning that g() will not halt for trillions of years because it has to brute force f(), but there’s a small chance that it will halt if it does this by chance, and it continues compute to figure this out. it’s interesting there that maybe f() can’t gamble that g() won’t halt maybe because g() could identify this and halt: and the need to not make that gamble is in a quite similar space to cryptographic guarantees being probabilistic in general.