(edited) I dunno that I buy that the Benford test is a desideratum at all levels of computational resources (if n is even, A(n) is even), but I’m still pretty hyped that you’re posting about logical uncertainty.
Actually, now I’m curious about the modulo arithmetic properties of Ackermann’s function.
(edited)
I dunno that I buy that the Benford test is a desideratum at all levels of computational resources (if n is even, A(n) is even), butI’m still pretty hyped that you’re posting about logical uncertainty.Actually, now I’m curious about the modulo arithmetic properties of Ackermann’s function.