News for hackers. Stuff that matters.
Re:UCLA Computer Grad Constructs “Crown Jewel of Cryptography” by scarmig on Wednesday May 24, 2023 @09:15PM (#36066034)
Can't finite iteration and recursion just be unrolled? And storage just considered another part of the input?
Re:UCLA Computer Grad Constructs “Crown Jewel of Cryptography” by grayhatter on Wednesday May 24, 2023 @09:58PM (#36066289)
In theory? Absolutely; unrolling a loop is exactly what it sounds like. Recursion is just a fancy loop. But there's a reason no one does that, and why no compilers emit that as code.
Re:UCLA Computer Grad Constructs “Crown Jewel of Cryptography” by User23 on Thursday May 25, 2023 @01:04AM (#36067206)
Fancy in the sense of being a loop with an implicit stack. Or maybe just some registers if TCO.

And yet the machines we can actually build are far closer to LBAs than TMs.

Re:UCLA Computer Grad Constructs “Crown Jewel of Cryptography” by jahewson on Wednesday May 24, 2023 @10:32PM (#36066461)
This is how SMT solvers deal with bounded quantifiers.