Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
maplant
on Dec 24, 2015
|
parent
|
context
|
favorite
| on:
The Problem with Friendly C
This solution relies on some undecidable problems as being decidable
analognoise
on Dec 24, 2015
[–]
How so? I don't see the connection to undeciability.
maplant
on Dec 24, 2015
|
parent
[–]
If you have undefined behaviour after an infinite loop that breaks on some condition, then that undefined behaviour will not necessarily have been triggered. Thus, no warning.
tamana
on Dec 24, 2015
|
root
|
parent
[–]
Regehr himself "disproved" Fermat's Last Theorem by abusing a non-terminating loop and over-aggressive compilers.
http://blog.regehr.org/archives/140
maplant
on Dec 24, 2015
|
root
|
parent
[–]
Yes, this I a great example of the consequences of undecidability. Was taught to me in my algorithms and proofs class
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: