Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
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
Consider applying for YC's Spring batch! Applications are open till Feb 11.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: