In article <87iq5khv47.fsf@dialatheia.truth.invalid>, Aatu Koskensilta <aatu.koskensilta@uta.fi> wrote:
> Virgil <Virgil@home.esc> writes: > > > There are undecidable propositions in mathematics, so if P is one of > > them then "x = 1 if P is true otherwise x = 0" defines an uncomputable > > number. > > Not in classical mathematics.
In classical mathematics are there propositions that are undecideable only because they would require infinitely many steps to decide the value of a particular digit?
