Y
Hacker News
new
|
ask
|
show
|
jobs
by
Beltiras
3927 days ago
Gödel's Incompleteness Theorem might be abstractable to this. Any system so inaccessible as to be unhackable might be functionally impaired beyond usefulness.
1 comments
jdefr89
3927 days ago
Godel's theorem is great for claims like this. Have they proved that the "theorem proving" software has no mistakes?
link
hga
3926 days ago
There's this:
http://proof-technologies.com/holzero/index.html
and I see some other things that I interpret as moving in that direction.
link