@sandmouth @andrejbauer @soaproot @dimpase As was (re)discovered over the summer at the HIM seminars is that certificates (i.e. positive information) for negative statements are very difficult. In particular things like "polynomial p is irreducible over field F" is fiendishly difficult. Certificates for the correctness of positive computations are quite easy, comparatively speaking.
=> More informations about this toot | View the thread | More toots from JacquesC2@types.pl
=> View sandmouth@types.pl profile | View andrejbauer@mathstodon.xyz profile | View soaproot@sfba.social profile | View dimpase@mathstodon.xyz profile
text/geminiThis content has been proxied by September (3851b).