Hacker News new | past | comments | ask | show | jobs | submit login

You can prove things even if then input domain has infinite size. For example n < n + 1 is always true. It's trivial to prove this. Yet the n can have infinite different values.



True.

Just one note, there are still edge cases, if n overflows the data type, you would have n > n + 1


Very pedantic but: In that case the size of the domain of n is not infite.




Join us for AI Startup School this June 16-17 in San Francisco!

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: