<rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Hacker News: mauricioc</title><link>https://news.ycombinator.com/user?id=mauricioc</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Thu, 16 Apr 2026 23:16:52 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=mauricioc" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[Mathematicians put AI model AlphaProof to the test]]></title><description><![CDATA[
<p>Article URL: <a href="https://www.nature.com/articles/d41586-025-03585-5">https://www.nature.com/articles/d41586-025-03585-5</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=45902146">https://news.ycombinator.com/item?id=45902146</a></p>
<p>Points: 3</p>
<p># Comments: 1</p>
]]></description><pubDate>Wed, 12 Nov 2025 16:30:44 +0000</pubDate><link>https://www.nature.com/articles/d41586-025-03585-5</link><dc:creator>mauricioc</dc:creator><comments>https://news.ycombinator.com/item?id=45902146</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45902146</guid></item><item><title><![CDATA[Olympiad-level formal mathematical reasoning with reinforcement learning]]></title><description><![CDATA[
<p>Article URL: <a href="https://www.nature.com/articles/s41586-025-09833-y">https://www.nature.com/articles/s41586-025-09833-y</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=45902122">https://news.ycombinator.com/item?id=45902122</a></p>
<p>Points: 3</p>
<p># Comments: 0</p>
]]></description><pubDate>Wed, 12 Nov 2025 16:28:59 +0000</pubDate><link>https://www.nature.com/articles/s41586-025-09833-y</link><dc:creator>mauricioc</dc:creator><comments>https://news.ycombinator.com/item?id=45902122</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45902122</guid></item><item><title><![CDATA[New comment by mauricioc in "That viral video of a 'deactivated' Tesla Cybertruck is a fake"]]></title><description><![CDATA[
<p><a href="https://www.smbc-comics.com/comic/aaaah" rel="nofollow">https://www.smbc-comics.com/comic/aaaah</a></p>
]]></description><pubDate>Tue, 12 Aug 2025 20:26:41 +0000</pubDate><link>https://news.ycombinator.com/item?id=44881412</link><dc:creator>mauricioc</dc:creator><comments>https://news.ycombinator.com/item?id=44881412</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44881412</guid></item><item><title><![CDATA[New comment by mauricioc in "Dynamic programming bursting balloons"]]></title><description><![CDATA[
<p>If you have "3 1 5" and you burst 1, you gain 3x1x5 points and the state becomes "3 5", with the two remaining balloons being adjacent to each other.<p>The "1x3x1=1" part for the earlier example is a typo indeed, it should be 3.</p>
]]></description><pubDate>Fri, 01 Aug 2025 21:27:03 +0000</pubDate><link>https://news.ycombinator.com/item?id=44762679</link><dc:creator>mauricioc</dc:creator><comments>https://news.ycombinator.com/item?id=44762679</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44762679</guid></item><item><title><![CDATA[New comment by mauricioc in "Tom Lehrer has died"]]></title><description><![CDATA[
<p>> I wouldn't say there's a ton to connect.<p>What's the point of your rude post? OP already knows this. In fact, they learned it from Tom Lehrer.</p>
]]></description><pubDate>Mon, 28 Jul 2025 11:53:13 +0000</pubDate><link>https://news.ycombinator.com/item?id=44709942</link><dc:creator>mauricioc</dc:creator><comments>https://news.ycombinator.com/item?id=44709942</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44709942</guid></item><item><title><![CDATA[New comment by mauricioc in "The Fastest Way yet to Color Graphs"]]></title><description><![CDATA[
<p>Parent's point is that sometimes (but not always) the store is perfectly fine selling you a car for $1 less than what the "price tag" of Delta(G)+1 dollars asks for, so "need" is a bit inaccurate.</p>
]]></description><pubDate>Sat, 17 May 2025 13:21:41 +0000</pubDate><link>https://news.ycombinator.com/item?id=44014142</link><dc:creator>mauricioc</dc:creator><comments>https://news.ycombinator.com/item?id=44014142</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44014142</guid></item><item><title><![CDATA[New comment by mauricioc in "The Fastest Way yet to Color Graphs"]]></title><description><![CDATA[
<p>For the edge-coloring problem, the optimal number of colors needed to properly color the edges of G is always either Delta(G) (the maximum degree of G) or Delta(G) + 1, but deciding which one is the true optimum is an NP-complete problem.<p>Nevertheless, you can always properly edge-color a graph with Delta(G) + 1 colors. <i>Finding</i> such a coloring could in principle be slow, though: the original proof that Delta(G) + 1 colors is always doable amounted to a O(e(G) * v(G)) algorithm, where e(G) and v(G) denote the number of edges and vertices of G, respectively. This is polynomial, but nowhere near linear. What the paper in question shows is how, given any graph G, to find an edge coloring using Delta(G) + 1 colors in O(e(G) * log(Delta(G))) time, which is linear time if the maximum degree is a constant.</p>
]]></description><pubDate>Thu, 15 May 2025 18:38:55 +0000</pubDate><link>https://news.ycombinator.com/item?id=43997959</link><dc:creator>mauricioc</dc:creator><comments>https://news.ycombinator.com/item?id=43997959</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=43997959</guid></item><item><title><![CDATA[New comment by mauricioc in "Icônes"]]></title><description><![CDATA[
<p>As you point out, 'icônes' is French for 'icons'; the name is probably related to the fact that the site is built using Vite. Was NES capitalized in the title earlier?</p>
]]></description><pubDate>Sun, 27 Apr 2025 13:42:30 +0000</pubDate><link>https://news.ycombinator.com/item?id=43811862</link><dc:creator>mauricioc</dc:creator><comments>https://news.ycombinator.com/item?id=43811862</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=43811862</guid></item><item><title><![CDATA[New comment by mauricioc in "Git without a forge"]]></title><description><![CDATA[
<p>> As it happens, I'm the kind of masochist who uses Sublime Text without any plugins for most of my programming, so I find value in letting people stick to their familiar workflow, even if some might see that workflow as somewhere between 'grossly inferior' and 'literally unusable'.<p>I definitely think there are upsides to not tweaking your text editor config endlessly, so I understand your point :) What I meant with "vim/emacs" is mostly that sometimes you really want to automate a text editing task, and then it's really convenient to have a programmable text editor. It's also very much a case of [0].<p>> I'm a bit curious, how well do these tools handle HTML email?<p>In my case, I use mu4e in emacs to read my mail. Very basic HTML works by default via emacs's native HTML renderer (see, e.g., [1] for old screenshots). That's my preferred solution because I like the keyboard consistency (it's just an emacs buffer) and because there is a command to view the email in an external browser if needed, but it is also possible to render HTML email accurately in emacs by embedding a webkit widget [2]. As for writing, you can write in Org mode format (emacs markdown, if you will) and it gets converted to HTML on send.<p>[0] <a href="https://www.xkcd.com/974/" rel="nofollow">https://www.xkcd.com/974/</a><p>[1] <a href="https://lars.ingebrigtsen.no/2015/02/10/eww-now-with-fonts/" rel="nofollow">https://lars.ingebrigtsen.no/2015/02/10/eww-now-with-fonts/</a><p>[2] <a href="https://www.reddit.com/r/emacs/comments/l60p6a/howto_mu4e_and_reading_html_mails_with_xwidget/" rel="nofollow">https://www.reddit.com/r/emacs/comments/l60p6a/howto_mu4e_an...</a></p>
]]></description><pubDate>Thu, 06 Mar 2025 18:41:51 +0000</pubDate><link>https://news.ycombinator.com/item?id=43283612</link><dc:creator>mauricioc</dc:creator><comments>https://news.ycombinator.com/item?id=43283612</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=43283612</guid></item><item><title><![CDATA[New comment by mauricioc in "Git without a forge"]]></title><description><![CDATA[
<p>> Of course, the classic response is "get a better MUA you luser"<p>Git is distributed and allows you to work efficiently with poor connectivity, having full history available at any time, which is a big accessibility point for people with limited connectivity (and also helps people working while traveling, for example). If you do have any email client, you get all of this as well, plus arbitrarily powerful, low-latency filtering and searching. I recommend Greg KH's "Patches carved into stone tablets" talk [0].<p>Despite your "luser" strawman, people advocating for client-side MUAs mean well and have a point. Try replacing "webmail" by "Notepad" and "client-side MUA" by "emacs/vim" to see how your argument sounds. You probably spend a decent amount of time interacting with email, and the investment in setting up a fast, flexible and powerful environment (preferably reusing your text editor for composing messages) for doing so pays for itself soon.<p>[0] <a href="https://www.youtube.com/watch?v=L8OOzaqS37s" rel="nofollow">https://www.youtube.com/watch?v=L8OOzaqS37s</a></p>
]]></description><pubDate>Thu, 06 Mar 2025 07:23:56 +0000</pubDate><link>https://news.ycombinator.com/item?id=43277401</link><dc:creator>mauricioc</dc:creator><comments>https://news.ycombinator.com/item?id=43277401</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=43277401</guid></item><item><title><![CDATA[New comment by mauricioc in "Asahi Linux lead developer Hector Martin resigns from Linux kernel"]]></title><description><![CDATA[
<p><a href="https://lore.kernel.org/rust-for-linux/CAHk-=wi=ZmP2=TmHsFSUGq8vUZAOWWSK1vrJarMaOhReDRQRYQ@mail.gmail.com/" rel="nofollow">https://lore.kernel.org/rust-for-linux/CAHk-=wi=ZmP2=TmHsFSU...</a><p>Edit: For further context for Linus's reply, there's <a href="http://web.archive.org/web/20250206022420/https://social.treehouse.systems/@marcan" rel="nofollow">http://web.archive.org/web/20250206022420/https://social.tre...</a></p>
]]></description><pubDate>Fri, 07 Feb 2025 14:04:40 +0000</pubDate><link>https://news.ycombinator.com/item?id=42972629</link><dc:creator>mauricioc</dc:creator><comments>https://news.ycombinator.com/item?id=42972629</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=42972629</guid></item><item><title><![CDATA[New comment by mauricioc in "The Art of Computer Programming, Volume 4, Fascicle 7: Constraint Satisfaction"]]></title><description><![CDATA[
<p>Volume 4, Fascicle 7 was officially released this week! The latest draft ("prefascicle", dated December 2024) is available at <a href="https://www-cs-faculty.stanford.edu/~knuth/fasc7a.ps.gz" rel="nofollow">https://www-cs-faculty.stanford.edu/~knuth/fasc7a.ps.gz</a>. As Knuth says, the contents "agree fairly well with the contents of the first paperback printing of Volume 4, Fascicle 7, except for parts of the index. As usual, the prefascicle is 'frozen' and will not be maintained, while the paperback will gradually improve with time."</p>
]]></description><pubDate>Fri, 07 Feb 2025 13:38:53 +0000</pubDate><link>https://news.ycombinator.com/item?id=42972367</link><dc:creator>mauricioc</dc:creator><comments>https://news.ycombinator.com/item?id=42972367</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=42972367</guid></item><item><title><![CDATA[The Art of Computer Programming, Volume 4, Fascicle 7: Constraint Satisfaction]]></title><description><![CDATA[
<p>Article URL: <a href="https://www.informit.com/store/art-of-computer-programming-volume-4-fascicle-7-constraint-9780135328248">https://www.informit.com/store/art-of-computer-programming-volume-4-fascicle-7-constraint-9780135328248</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=42972354">https://news.ycombinator.com/item?id=42972354</a></p>
<p>Points: 4</p>
<p># Comments: 1</p>
]]></description><pubDate>Fri, 07 Feb 2025 13:36:37 +0000</pubDate><link>https://www.informit.com/store/art-of-computer-programming-volume-4-fascicle-7-constraint-9780135328248</link><dc:creator>mauricioc</dc:creator><comments>https://news.ycombinator.com/item?id=42972354</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=42972354</guid></item><item><title><![CDATA[New comment by mauricioc in "A Linux maintainer admitting to attempting to sabotage Rust for Linux project"]]></title><description><![CDATA[
<p>The real scandal here is the pressure to remove a maintainer based on vague "code of conduct violation grounds" when the supposed "violation" is just expressing an technical preference on code he maintains. Shamelessly weaponizing a code of conduct like this should be a code of conduct violation in itself.<p>(I am a big proponent of language interop as an alternative to big rewrites. But opinions differ, and my opinion is worth nothing because I'm not a maintainer of the relevant code.)</p>
]]></description><pubDate>Tue, 04 Feb 2025 14:15:26 +0000</pubDate><link>https://news.ycombinator.com/item?id=42932573</link><dc:creator>mauricioc</dc:creator><comments>https://news.ycombinator.com/item?id=42932573</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=42932573</guid></item><item><title><![CDATA[New comment by mauricioc in "This open problem taught me what topology is [video]"]]></title><description><![CDATA[
<p>The function defined in the video is "Given a pair of points A and B on the curve, output (x, y, z), where (x, y) is the midpoint and z is the length of the segment connecting A and B", and the pictures are of its image, not its graph. But if you define it visually, then it's very natural to misunderstand it the way you did, since the picture looks a lot like a function graph of a function which takes midpoints (instead of pairs of points) and returns the distance corresponding to that midpoint (which is not well-defined, as you pointed out). If this happens, the viewer is then completely lost, since the rest of the video is dedicated to explaining that the domain of this function is a Möbius strip when you consider it to consist of <i>unordered</i> pairs of points {A, B} (as one should).<p>Ultimately, if you don't have a 100% formal version of a given statement, some people will find a interpretation different from the intended one (and this is independent of how clever the audience is!). I think 3Blue1Brown knows this and is experimenting with alternate formats; the video is also available as an interactive blog post (<a href="https://www.3blue1brown.com/lessons/inscribed-rect-v2" rel="nofollow">https://www.3blue1brown.com/lessons/inscribed-rect-v2</a>) which explicitly defines the function as "f(A, B) = (x, y, z)" and explains what the variables are.<p>The fact that "given a large enough audience (even of very smart people), there will be different interpretations of any given informal explanation" is a key challenge in teaching mathematics, since it is very unpredictable. In interactive contexts it is possible to interrupt a lecture and ask questions, but it still provides an incentive to focus on formalism, which can leave less time for explaining visualizations and intuition.</p>
]]></description><pubDate>Wed, 25 Dec 2024 15:59:13 +0000</pubDate><link>https://news.ycombinator.com/item?id=42509380</link><dc:creator>mauricioc</dc:creator><comments>https://news.ycombinator.com/item?id=42509380</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=42509380</guid></item><item><title><![CDATA[New comment by mauricioc in "38th Chaos Communication Congress"]]></title><description><![CDATA[
<p>Now I really want to go to a "Sexuality, Gender and Hacking the RP2350" talk. Maybe next year?</p>
]]></description><pubDate>Tue, 24 Dec 2024 11:18:27 +0000</pubDate><link>https://news.ycombinator.com/item?id=42501200</link><dc:creator>mauricioc</dc:creator><comments>https://news.ycombinator.com/item?id=42501200</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=42501200</guid></item><item><title><![CDATA[New comment by mauricioc in "GIMP 3.0 is on the way"]]></title><description><![CDATA[
<p>Valid point, but I will also amend your nitpick: Schwarz is also a name of a lot of people :) Both refer to hair colour, I think. "Schwartz" was a valid spelling for the colour many centuries ago (see, e.g., item 15 in [1]), which makes sense since both spellings are pronounced the same way. Surnames don't follow spelling changes, so that's the only situation in which both variants coexist now. In maths, you have the Cauchy-Schwarz inequality and Schwartz's theory of distributions.<p>[1] <a href="https://woerterbuchnetz.de/?sigle=DWB&lemid=S04549" rel="nofollow">https://woerterbuchnetz.de/?sigle=DWB&lemid=S04549</a></p>
]]></description><pubDate>Fri, 29 Nov 2024 15:31:25 +0000</pubDate><link>https://news.ycombinator.com/item?id=42274504</link><dc:creator>mauricioc</dc:creator><comments>https://news.ycombinator.com/item?id=42274504</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=42274504</guid></item><item><title><![CDATA[New comment by mauricioc in "The Long Road to End Tuberculosis"]]></title><description><![CDATA[
<p>The WHO [0] reports 60 thousand Covid deaths this year so far, and around 250 thousand deaths in 2023.<p>[0] <a href="https://data.who.int/dashboards/covid19/deaths" rel="nofollow">https://data.who.int/dashboards/covid19/deaths</a></p>
]]></description><pubDate>Mon, 11 Nov 2024 09:49:53 +0000</pubDate><link>https://news.ycombinator.com/item?id=42105788</link><dc:creator>mauricioc</dc:creator><comments>https://news.ycombinator.com/item?id=42105788</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=42105788</guid></item><item><title><![CDATA[The ∞-Cosmos Project]]></title><description><![CDATA[
<p>Article URL: <a href="https://leanprover-community.github.io/blog/posts/infinity-cosmos-announcement/">https://leanprover-community.github.io/blog/posts/infinity-cosmos-announcement/</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=41578383">https://news.ycombinator.com/item?id=41578383</a></p>
<p>Points: 2</p>
<p># Comments: 0</p>
]]></description><pubDate>Wed, 18 Sep 2024 11:29:22 +0000</pubDate><link>https://leanprover-community.github.io/blog/posts/infinity-cosmos-announcement/</link><dc:creator>mauricioc</dc:creator><comments>https://news.ycombinator.com/item?id=41578383</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=41578383</guid></item><item><title><![CDATA[New comment by mauricioc in "Coq will be renamed into 'The Rocq Prover'"]]></title><description><![CDATA[
<p>Previously: <a href="https://news.ycombinator.com/item?id=38779480">https://news.ycombinator.com/item?id=38779480</a></p>
]]></description><pubDate>Wed, 07 Aug 2024 12:37:54 +0000</pubDate><link>https://news.ycombinator.com/item?id=41180758</link><dc:creator>mauricioc</dc:creator><comments>https://news.ycombinator.com/item?id=41180758</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=41180758</guid></item></channel></rss>