Intuitionistic Mathematics, Computable Reals, Bishop Mathematics, Proof Relevance
Problem-solving is fundamental to human nature
freethink.com·11h
Brent Yorgey: Competitive programming in Haskell: range queries, classified
byorgey.github.io·3d
Structural Optimal Jacobian Accumulation and Minimum Edge Count are NP-Complete Under Vertex Elimination
arxiv.org·2d
COIN: Uncertainty-Guarding Selective Question Answering for Foundation Models with Provable Risk Guarantees
arxiv.org·1h
LFCS Seminar Tuesday 8th July: John Longley
informatics.ed.ac.uk·2d
Counting with Categories (Part 1)
golem.ph.utexas.edu·3d
Perfect phylogenies via the Minimum Uncovering Branching problem: efficiently solvable cases
arxiv.org·2d
Loading...Loading more...