#20920: Changes to Unknown class
-------------------------------------+-------------------------------------
Reporter: eviatarbach | Owner:
Type: enhancement | Status: new
Priority: major | Milestone: sage-7.3
Component: misc | Resolution:
Keywords: days78 | Merged in:
Authors: | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/eviatarbach/unknown | 7d95643efc6699998240ba08c95006ae4fd9c482
Dependencies: #20919 | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by vdelecroix):
Replying to [comment:8 eviatarbach]:
> Ah yes, I see vdelecroix's point.
>
> It does seem that it would not be too useful to let the user know that
the general problem is undecidable given an instance of it that the
algorithm is not able to solve. If we made use of
[https://en.wikipedia.org/wiki/Richardson%27s_theorem Richardson's
theorem], for example, to return `Undecidable` for testing equality for a
certain class of symbolic expressions, we could confuse the user into
believing a certain problem was "impossible" even when a trivial heuristic
solution exists.
>
> Perhaps information on undecidability of a problem should be left to
documentation?
Having this in the documentation looks like a good idea to me!
--
Ticket URL: <https://trac.sagemath.org/ticket/20920#comment:10>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at https://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
