# Caleb Stanford Blog

## On Finite Computational Complexity

logic research

Some notes on an idea for defining better computational complexity for finite languages: here.