2 ms·
You don't need to go anywhere near 400 bytes to find inscrutable programs, if your programming language is concise enough. Even 8 bytes, or 64 bits to be precis
by tromp 3y ago
You don't need to go anywhere near 400 bytes to find inscrutable programs, if your programming language is concise enough. Even 8 bytes, or 64 bits to be precise, offers plenty unchartered territory for finding new gems in lambda calculus [1], one such recent discovery being a 49 bit program whose output exceeds Graham's number.
[1] https://oeis.org/A333479 https://oeis.org/A333479
- zarathustreal 3y agoHonestly why bother with actual bytes? Why not just take Wolfram’s approach of looking through programs encoded as cellular automata?
- jakeogh 3y agoFrom the oeis link: https://tromp.github.io/blog/2023/11/24/largest-number https://tromp.github.io/blog/2023/11/24/largest-number
- tromp 3y agoAcutally, I only learned about the 49 bit program after writing that blog entry. It is described in https://github.com/tromp/AIT/blob/master/fast_growing_and_conjectures/melo.lam https://github.com/tromp/AIT/blob/master/fast_growing_and_co...