DanielLC comments on Progress on automated mathematical theorem proving? - Less Wrong

14 Post author: JonahSinick 03 July 2013 06:40PM

You are viewing a comment permalink. View the original post to see all comments and the full post content.

Comments (65)

You are viewing a single comment's thread. Show more comments above.

Comment author: DanielLC 04 July 2013 07:20:35PM 1 point [-]

"there is no tractable Turing Machine that takes a public key as input and outputs the corresponding private key with non-negligible probability"

But that's going to take an insanely powerful theorem-prover. Also, this is more the theorem-proving end than automated program end.

Comment author: Strilanc 04 July 2013 08:59:04PM 1 point [-]

It's true that it would need to be insanely powerful. Even clever humans haven't managed to prove that one-way hash functions exist (though we know a function that is one-way if and only if they exist...).

Note theorem proving is isomorphic to programming. Even if it wasn't quite so equivalent, you could just ask for a constructive proof of a program satisfying whatever and the proof would contain the program.