[tnecniv]

My understanding from the article (while I would like to read the paper, I don't have time at the moment) is that it assigns probabilities that a conjecture is correct and improves these estimates over time. As such, something will only really be proven true when the probability hits 1. The summary says that this will occur in the limit, but that might take as long as proving things the traditional way and mathematicians don't like things that are probably true but not proven.

That said, I can think of a number of uses for such an algorithm. If you load it full of conjectures in your field that are known to be true, it will might help you hone what problems are worth exploring by providing guess at how likely it is you can prove a statement you are pondering.

[jey]

This algorithm is not practical to implement using any computer that would fit on Earth. It's primarily of theoretical interest.

[catnaroek]

> something will only really be proven true when the probability hits 1

Careful. An event can have probability 1 even if its complement isn't empty: https://en.wikipedia.org/wiki/Almost_surely

[joshcohen]

In this setting we're using discrete probabilities so we don't have to worry:)

[tnecniv]

Good catch. The nuances of the continuum are many and subtle.