if a predicate depends on finitely many bits then you can exhaustively check whe...

		CraneWorm on Oct 29, 2021 \| parent \| context \| favorite \| on: Seemingly impossible functional programs (2007) if a predicate depends on finitely many bits then you can exhaustively check whether it is total by enumerating all of it's possible inputs