Hilbert’s tenth: from machines to equations, and a new rational-case claim
How integer equations encode computation, what formalization checks, and how to read OpenAI’s model-generated claim over the rationals.
The notebook
Notes on code, computer science, and the ideas underneath.
A small archive of things I’ve learned along the way.
8 articles
How integer equations encode computation, what formalization checks, and how to read OpenAI’s model-generated claim over the rationals.
Mixing data-fetching behavior into React components with a reusable higher-order component.
A hands-on introduction to map, reduce, and counting characters with Haskell.
A look at string searching, the bad-character rule, and the good-suffix rule.
Diophantine equations, Hilbert’s tenth problem, and the beginnings of a formalisation project in Isabelle.
Thinking through recursion in Haskell, from a simple sum to the Fibonacci sequence.
What makes an algorithm scalable — and what it actually means for an algorithm to be correct.
Divide, conquer, and combine: a closer look at recursive algorithms and repeated work.
A longer reference notebook of algorithms, examples, and study notes.
Try another search or explore all the writing.