John

John is a researcher specializing in theoretical computer science with a focus on lambda calculus, combinatory logic, and algorithmic information theory. His work includes developing minimalistic universal computers, improving constants in foundational theorems, and creating interpreters for formal systems.

• Contributions include a 206-bit binary lambda calculus self-interpreter and a 167-bit primes program.
• Won 'Most functional' award in the 2012 International Obfuscated C Code Contest for an interpreter.
• Collaborated with Bertram Felgenhauer to reduce symmetry-of-information theorem constants via monadic evaluation techniques.

Research spans Kolmogorov complexity, halting probability calculations, and functional programming language design. Implements ideas in Haskell and creates interpreters for lambda calculus variants.