<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: ultrafilter</title><link>https://news.ycombinator.com/user?id=ultrafilter</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Mon, 27 Apr 2026 10:04:52 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=ultrafilter" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by ultrafilter in "If gravity isn't a force, then why does it "need" a boson?"]]></title><description><![CDATA[
<p>Your charge-based g-meter would also measure zero acceleration in free fall.<p><a href="https://en.wikipedia.org/wiki/Paradox_of_radiation_of_charged_particles_in_a_gravitational_field" rel="nofollow">https://en.wikipedia.org/wiki/Paradox_of_radiation_of_charge...</a></p>
]]></description><pubDate>Wed, 20 Mar 2024 19:18:57 +0000</pubDate><link>https://news.ycombinator.com/item?id=39770846</link><dc:creator>ultrafilter</dc:creator><comments>https://news.ycombinator.com/item?id=39770846</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=39770846</guid></item><item><title><![CDATA[New comment by ultrafilter in "A scalar triple product identity"]]></title><description><![CDATA[
<p>Near the end, the author claims that if a,b,c form a basis of R3,
then the cross products a x b, b x c, and c x a are orthogonal.<p>This is false. E.g., a=(1,1,0), b=(0,1,1), c=(1,0,1) implies<p>a x b = (+1,-1,+1), b x c = (+1,+1,-1), c x a = (-1,+1,+1).<p>However, this "dual basis" still serves its claimed purpose,
which essentially is to precompute part of Cramer's rule.</p>
]]></description><pubDate>Sat, 26 Aug 2023 04:22:17 +0000</pubDate><link>https://news.ycombinator.com/item?id=37269920</link><dc:creator>ultrafilter</dc:creator><comments>https://news.ycombinator.com/item?id=37269920</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=37269920</guid></item><item><title><![CDATA[New comment by ultrafilter in "Show HN: SpicyPass – A free and open-source minimalist password manager"]]></title><description><![CDATA[
<p>If I have a keyboard, then for a relatively small dataset, such as my saved passwords, I prefer a text file over any database. Lookup workflow: decrypt file (with, say, gpg), find what I want (with, say, grep), delete decrypted file. (Not safe if you don't use disk encryption!) Update workflow: decrypt file, edit file, encrypt file, commit encrypted file to local git repo, git push to backup storage.</p>
]]></description><pubDate>Sat, 28 Mar 2020 23:27:53 +0000</pubDate><link>https://news.ycombinator.com/item?id=22715113</link><dc:creator>ultrafilter</dc:creator><comments>https://news.ycombinator.com/item?id=22715113</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=22715113</guid></item><item><title><![CDATA[New comment by ultrafilter in "The field of “useful reals” between rational and real numbers (2019)"]]></title><description><![CDATA[
<p>Set theorists have located the "end" for all practical and most impractical purposes. Let M be the minimal countable transitive model of ZFC. Declare a real to be useful if and only if it is in M.</p>
]]></description><pubDate>Tue, 24 Mar 2020 21:23:13 +0000</pubDate><link>https://news.ycombinator.com/item?id=22679173</link><dc:creator>ultrafilter</dc:creator><comments>https://news.ycombinator.com/item?id=22679173</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=22679173</guid></item><item><title><![CDATA[New comment by ultrafilter in "Get Your Book, Make It Free"]]></title><description><![CDATA[
<p>If you're giving the book away, why not release the source (LaTeX, Word, whatever) in addition to your favorite subset of {PDF,EPUB,...}? Then readers who want a different format have a better chance of being able to produce it themselves.</p>
]]></description><pubDate>Fri, 17 May 2019 16:18:08 +0000</pubDate><link>https://news.ycombinator.com/item?id=19940990</link><dc:creator>ultrafilter</dc:creator><comments>https://news.ycombinator.com/item?id=19940990</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=19940990</guid></item><item><title><![CDATA[New comment by ultrafilter in "The Tyranny of the Clock (2012) [pdf]"]]></title><description><![CDATA[
<p>The author's more recent work is here:<p><a href="http://arc.cecs.pdx.edu/publications" rel="nofollow">http://arc.cecs.pdx.edu/publications</a></p>
]]></description><pubDate>Sat, 21 Jul 2018 16:49:12 +0000</pubDate><link>https://news.ycombinator.com/item?id=17582613</link><dc:creator>ultrafilter</dc:creator><comments>https://news.ycombinator.com/item?id=17582613</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=17582613</guid></item><item><title><![CDATA[Surface codes: Towards practical large-scale quantum computation (2012)]]></title><description><![CDATA[
<p>Article URL: <a href="https://arxiv.org/abs/1208.0928">https://arxiv.org/abs/1208.0928</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=16127749">https://news.ycombinator.com/item?id=16127749</a></p>
<p>Points: 1</p>
<p># Comments: 0</p>
]]></description><pubDate>Thu, 11 Jan 2018 20:55:10 +0000</pubDate><link>https://arxiv.org/abs/1208.0928</link><dc:creator>ultrafilter</dc:creator><comments>https://news.ycombinator.com/item?id=16127749</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=16127749</guid></item><item><title><![CDATA[New comment by ultrafilter in "The Foundations of Mathematics (2007) [pdf]"]]></title><description><![CDATA[
<p>You're right. I should have written "halts last among its peers" or similar.</p>
]]></description><pubDate>Fri, 05 Jan 2018 23:25:33 +0000</pubDate><link>https://news.ycombinator.com/item?id=16082680</link><dc:creator>ultrafilter</dc:creator><comments>https://news.ycombinator.com/item?id=16082680</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=16082680</guid></item><item><title><![CDATA[New comment by ultrafilter in "The Foundations of Mathematics (2007) [pdf]"]]></title><description><![CDATA[
<p>Every formal axiom system, whether about sets or anything else, can only prove that N of Busy Beavers halt, for some (not-too-large in practice) finite number N. If you just want to maximize N, right now your best bet is set theory plus a very strong large cardinal axiom, like I0.<p><a href="http://cantorsattic.info/L_of_V_lambda%2B1" rel="nofollow">http://cantorsattic.info/L_of_V_lambda%2B1</a><p>Perhaps simply because it is older, set theory is way ahead of its competitors in developing a hierarchy of extremely strong (but apparently consistent) axioms to supplement its base theory ZFC.</p>
]]></description><pubDate>Fri, 05 Jan 2018 16:56:30 +0000</pubDate><link>https://news.ycombinator.com/item?id=16079731</link><dc:creator>ultrafilter</dc:creator><comments>https://news.ycombinator.com/item?id=16079731</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=16079731</guid></item><item><title><![CDATA[New comment by ultrafilter in "Cryptocurrency Analysis with Python – Log Returns"]]></title><description><![CDATA[
<p>Nice overall; my only complaint is that you raised the question "Are LTC log returns normally distributed?" but only gave an uninterpreted graphical comparsion. I was hoping for a test statistic...<p><a href="https://en.wikipedia.org/wiki/Normality_test" rel="nofollow">https://en.wikipedia.org/wiki/Normality_test</a></p>
]]></description><pubDate>Fri, 29 Dec 2017 21:40:11 +0000</pubDate><link>https://news.ycombinator.com/item?id=16032187</link><dc:creator>ultrafilter</dc:creator><comments>https://news.ycombinator.com/item?id=16032187</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=16032187</guid></item><item><title><![CDATA[The choiceless cardinals are inconsistent]]></title><description><![CDATA[
<p>Article URL: <a href="https://arxiv.org/abs/1712.09678">https://arxiv.org/abs/1712.09678</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=16031601">https://news.ycombinator.com/item?id=16031601</a></p>
<p>Points: 1</p>
<p># Comments: 0</p>
]]></description><pubDate>Fri, 29 Dec 2017 19:59:57 +0000</pubDate><link>https://arxiv.org/abs/1712.09678</link><dc:creator>ultrafilter</dc:creator><comments>https://news.ycombinator.com/item?id=16031601</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=16031601</guid></item><item><title><![CDATA[New comment by ultrafilter in "Microsoft Adds an OpenSSH Client to Windows 10"]]></title><description><![CDATA[
<p>I put a copy of putty at a short but private url at my own domain so that I can get it over https.</p>
]]></description><pubDate>Tue, 12 Dec 2017 16:23:46 +0000</pubDate><link>https://news.ycombinator.com/item?id=15906767</link><dc:creator>ultrafilter</dc:creator><comments>https://news.ycombinator.com/item?id=15906767</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=15906767</guid></item><item><title><![CDATA[New comment by ultrafilter in "Show HN: Effects of House and Senate Bill on California Residents"]]></title><description><![CDATA[
<p>Indeed, the source code only considers tax brackets, the personal exemption, and the standard deduction. I've read of an increase of $650 in the per-child tax credit combined with the loss of the per-dependent personal exemption and an increase in the standard deduction. If your last $4333 of annual income is going to be taxed at rate of 15%, then a $650 credit is just as valuable as a $4333 deduction or exemption and thus slightly more valuable than the current $4050 personal exemption. Thus, contrary to this calculator, middle-class families with lots of kids will not get big tax increases.</p>
]]></description><pubDate>Wed, 06 Dec 2017 23:32:33 +0000</pubDate><link>https://news.ycombinator.com/item?id=15866146</link><dc:creator>ultrafilter</dc:creator><comments>https://news.ycombinator.com/item?id=15866146</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=15866146</guid></item><item><title><![CDATA[New comment by ultrafilter in "Quadratic voting (2014)"]]></title><description><![CDATA[
<p>Yes. Perhaps the voting currency should be hours, not dollars. Make the first vote free. But N-1 more votes costs you N^2-1 hours from your "registered community service" account maintained by the government. No overdrafts allowed: the hours must be credited before they can be debited.</p>
]]></description><pubDate>Sat, 09 Sep 2017 18:15:39 +0000</pubDate><link>https://news.ycombinator.com/item?id=15208360</link><dc:creator>ultrafilter</dc:creator><comments>https://news.ycombinator.com/item?id=15208360</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=15208360</guid></item><item><title><![CDATA[New comment by ultrafilter in "American energy use"]]></title><description><![CDATA[
<p>The Carnot cycle is a poor model for steam turbine electric power plants. Rankine cycle efficiency of ~40% is the more 
relevant theoretical upper limit.<p><a href="https://en.wikipedia.org/wiki/Rankine_cycle" rel="nofollow">https://en.wikipedia.org/wiki/Rankine_cycle</a></p>
]]></description><pubDate>Mon, 08 May 2017 20:29:36 +0000</pubDate><link>https://news.ycombinator.com/item?id=14295303</link><dc:creator>ultrafilter</dc:creator><comments>https://news.ycombinator.com/item?id=14295303</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=14295303</guid></item><item><title><![CDATA[New comment by ultrafilter in "A program that accepts exactly any desired finite set, in the right universe"]]></title><description><![CDATA[
<p>In the real world, Hamkins' program would search forever, never outputting anything. In the context of a "nonstandard" version of the line of natural numbers, "finite" no longer means what you think it means. In this context, Hamkin's program does output something after a "finite" number of steps, and Hamkins can make the program output whatever he wants by changing the meaning of "finite" instead of changing the program.</p>
]]></description><pubDate>Sun, 07 May 2017 22:40:09 +0000</pubDate><link>https://news.ycombinator.com/item?id=14288125</link><dc:creator>ultrafilter</dc:creator><comments>https://news.ycombinator.com/item?id=14288125</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=14288125</guid></item><item><title><![CDATA[New comment by ultrafilter in "Data diversity: Preserving variety in data sets should aid machine learning"]]></title><description><![CDATA[
<p>The article has a link in a sidebar:<p><a href="https://arxiv.org/abs/1608.01008v2" rel="nofollow">https://arxiv.org/abs/1608.01008v2</a></p>
]]></description><pubDate>Sun, 18 Dec 2016 22:17:42 +0000</pubDate><link>https://news.ycombinator.com/item?id=13208038</link><dc:creator>ultrafilter</dc:creator><comments>https://news.ycombinator.com/item?id=13208038</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=13208038</guid></item><item><title><![CDATA[New comment by ultrafilter in "The Space Doctor’s Big Idea"]]></title><description><![CDATA[
<p>I think your watch is slow and you think mine is slow in the following sense. For each of many events, I record their time t and position x while you, moving relative to me at constant velocity, observe a different time T and position X. Between two events with the same X-value, such as ticks of your pocket watch, the difference in t-times is larger than the difference in T-times by a factor gamma. Conversely, between two events with the same x-position, such as ticks of my pocket watch, the difference in T-times is larger than the difference in t-times by that same factor gamma.<p>There is no contradiction because events with identical x-positions do not have identical X-positions.<p>If you already know what a partial derivative is, see the first paragraph of this: <a href="http://mathpages.com/rr/s4-07/4-07.htm" rel="nofollow">http://mathpages.com/rr/s4-07/4-07.htm</a></p>
]]></description><pubDate>Thu, 19 Nov 2015 06:10:53 +0000</pubDate><link>https://news.ycombinator.com/item?id=10593035</link><dc:creator>ultrafilter</dc:creator><comments>https://news.ycombinator.com/item?id=10593035</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=10593035</guid></item><item><title><![CDATA[New comment by ultrafilter in "Homeschooled with MIT courses at 5, accepted to MIT at 15"]]></title><description><![CDATA[
<p>In contrast (but not contradiction) with your experience, as an MIT undergraduate math major applying for PhD programs, my advisor warned me that the math dept. doesn't admit their own graduates. I applied anyway and indeed was not admitted (which was fine since I was admitted to UW-Madison, where I most wanted to go).</p>
]]></description><pubDate>Wed, 18 Nov 2015 18:28:58 +0000</pubDate><link>https://news.ycombinator.com/item?id=10589697</link><dc:creator>ultrafilter</dc:creator><comments>https://news.ycombinator.com/item?id=10589697</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=10589697</guid></item><item><title><![CDATA[New comment by ultrafilter in "Polynomial-Time Hierarchy Is Infinite Under a Random Oracle"]]></title><description><![CDATA[
<p>Theorems 1 and 3 are finitary and easier to physically interpret. As for Theorem 2,
"With probably p a random foo has property bar" intends no interpretation of "random foo"; it merely claims that the set of foo's with property bar has measure p with respect to some probability measure. In this case, the probability measure is the Bernoulli measure.<p><a href="http://www.encyclopediaofmath.org/index.php/Bernoulli_measure" rel="nofollow">http://www.encyclopediaofmath.org/index.php/Bernoulli_measur...</a></p>
]]></description><pubDate>Wed, 22 Apr 2015 04:39:06 +0000</pubDate><link>https://news.ycombinator.com/item?id=9418678</link><dc:creator>ultrafilter</dc:creator><comments>https://news.ycombinator.com/item?id=9418678</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=9418678</guid></item></channel></rss>