Serious formal work, conducted on an unserious substrate.
SIGBOVIK 2026 proceedings — Carnegie Mellon University, April 10, 2026.
COME FROM Considered Helpful
A formal argument that INTERCAL's most notorious construct is not optional — that COME FROM is computationally necessary, not merely a provocation. Read it in the SIGBOVIK 2026 proceedings ↗
Optimal Graph Traversal Under Adversarial Constraints
A bitwise approach to memory-constrained environments — an 8×8 Knight's Tour solved with Warnsdorff's heuristic and Arnd Roth tiebreaking, as a bitboard, in a language with 16-bit variables and no arrays worth the name. Read it in the SIGBOVIK 2026 proceedings ↗
PLEASEABSTAIN
