1. Forum
  2. Usenet
  3. SCI.MATH.SYMBOLIC

  • Eliminating decision problem undecidability

    From Richard Fateman@21:1/5 to All on Mon Mar 15 14:24:39 2021
    Since there are undecidable problems in computer algebra system having to do with zero-equivalence,
    for example, see

    https://en.wikipedia.org/wiki/Richardson%27s_theorem

    your conclusion is false.

    From this one can conclude that at least one of your premises is false, and/or your method of
    deduction is flawed.

    RJF

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)