<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: xscott</title><link>https://news.ycombinator.com/user?id=xscott</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Wed, 29 Jul 2026 04:21:08 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=xscott" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by xscott in "How real are real numbers? (2004)"]]></title><description><![CDATA[
<p>I can't speak to the religious bits or history.  That's certainly not my motivation for thinking about this stuff.  It's not about computational convenience either.  Both of those seem like strawmen, but maybe they're relevant to other people.<p>The problem to me is that the Reals which aren't computable are absurd.  We've never used any of them in all history.  We can only put names on a very special few, those are countable, and we don't even know their value very well.<p>And the main way we prove that the Reals are uncountable is to use a proof by contradiction.  It would take too long to spell it out, but they aren't really just contradicting "Reals are Countable".  It's "All that other stuff we think is true AND Reals are Countable" that gets contradicted.<p>Once you accept the Reals, the Axiom of Choice is not simply obvious any more.  And if you go down that path you get things like the Banach-Tarski paradox.  To me THAT ought to be a proof by contradiction that we've made a mistake somewhere.<p>More interesting than that though:  If the universe we live in requires non-computable Reals to describe it carefully, then it says something very weird about determinism.  In order to compute a future state of a system, we need to use numbers we can't compute?!?</p>
]]></description><pubDate>Tue, 28 Jul 2026 17:37:58 +0000</pubDate><link>https://news.ycombinator.com/item?id=49087317</link><dc:creator>xscott</dc:creator><comments>https://news.ycombinator.com/item?id=49087317</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49087317</guid></item><item><title><![CDATA[New comment by xscott in "How real are real numbers? (2004)"]]></title><description><![CDATA[
<p>No matter how small you go, between every two real numbers is a computable number, and between every two computable numbers is a real number that's not computable.  If you restricted yourself to computable numbers, are you sure there are any holes in your graphs and functions?  Can you point to or name one?<p>:-)</p>
]]></description><pubDate>Tue, 28 Jul 2026 16:36:15 +0000</pubDate><link>https://news.ycombinator.com/item?id=49086451</link><dc:creator>xscott</dc:creator><comments>https://news.ycombinator.com/item?id=49086451</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49086451</guid></item><item><title><![CDATA[New comment by xscott in "Our position on open-weights models"]]></title><description><![CDATA[
<p>I'm cynical enough that I would suspect all of his statements are duplicitous anyway, but my recent experiences with Claude Fable give weight to it.<p>I asked a question about a series of tokens - bam, denied and downgraded.  There's no cyber security or public risk here, but Fable doesn't want me to learn how things work.<p>I asked a question about quantization in models - bam, denied and downgraded.  I edit my question to make it clear I'm talking about Google's Gemma QAT models.  Oh, that's fine then, and it answered the question helpfully.<p>Anti-competitive bullshit.  I hope they fail.</p>
]]></description><pubDate>Mon, 27 Jul 2026 23:20:41 +0000</pubDate><link>https://news.ycombinator.com/item?id=49076914</link><dc:creator>xscott</dc:creator><comments>https://news.ycombinator.com/item?id=49076914</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49076914</guid></item><item><title><![CDATA[New comment by xscott in "How real are real numbers? (2004)"]]></title><description><![CDATA[
<p>I'm on your side for most of what you say.  This topic has been interesting to me for years.  I've considered going back to school to build on my math degree, specifically because of this topic.<p>However, I thought things like Chaitin's Constants (you could make one per programming language) are real numbers you can name but not compute.  I think you could do this from any undecidable problem.<p>Of course there only a countable number of those Reals.  And they still don't seem useful for much more than naval gazing.</p>
]]></description><pubDate>Mon, 27 Jul 2026 21:28:22 +0000</pubDate><link>https://news.ycombinator.com/item?id=49075752</link><dc:creator>xscott</dc:creator><comments>https://news.ycombinator.com/item?id=49075752</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49075752</guid></item><item><title><![CDATA[New comment by xscott in "Chinese chipmaker shares surge 470%"]]></title><description><![CDATA[
<p>All the terms are squishy, but being sloppy about it, I think there's intelligence that needs to be in the model, and knowledge that could live in a database.  Right now, models are memorizing a lot of stuff they don't need to.  We know how to index lots of information on (comparatively slow) SSDs or across a network.<p>See Karpathy's "Cognitive Core" idea.  (I don't have a good link)</p>
]]></description><pubDate>Mon, 27 Jul 2026 11:55:33 +0000</pubDate><link>https://news.ycombinator.com/item?id=49068283</link><dc:creator>xscott</dc:creator><comments>https://news.ycombinator.com/item?id=49068283</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49068283</guid></item><item><title><![CDATA[New comment by xscott in "Why care about programming languages"]]></title><description><![CDATA[
<p>As far as I can tell, the good models will use whatever you give them.  So it seems we should only give them language features that help humans understand and maintain what the model writes.<p>Amusingly, a friend had Claude write some BrainF*ck the other day.  Non-trivial algorithm, and it made working code on the first try.</p>
]]></description><pubDate>Mon, 27 Jul 2026 11:16:59 +0000</pubDate><link>https://news.ycombinator.com/item?id=49067889</link><dc:creator>xscott</dc:creator><comments>https://news.ycombinator.com/item?id=49067889</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49067889</guid></item><item><title><![CDATA[New comment by xscott in "Kimi-K3 on HuggingFace"]]></title><description><![CDATA[
<p>Exploring compression algorithms for weights is a good idea, and I hope you have a successful product.  However, if you can prove this statement:<p>> reduces it down to its minimum entropy -- it cannot be compressed further.<p>I think you could make a lot more money elsewhere :-)<p><a href="https://en.wikipedia.org/wiki/Kolmogorov_complexity#Formal_proof_of_uncomputability_of_K" rel="nofollow">https://en.wikipedia.org/wiki/Kolmogorov_complexity#Formal_p...</a></p>
]]></description><pubDate>Mon, 27 Jul 2026 10:56:54 +0000</pubDate><link>https://news.ycombinator.com/item?id=49067720</link><dc:creator>xscott</dc:creator><comments>https://news.ycombinator.com/item?id=49067720</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49067720</guid></item><item><title><![CDATA[New comment by xscott in "Why care about programming languages"]]></title><description><![CDATA[
<p>> we may need some mechanism to translate the code from terse way to the verbose way<p>I completely agree.  Nothing says humans need to read in exactly the syntax the model wrote.  We could give the model a typed lisp, or forth, or rebol, or whatever works best, and it could be formatted into LaTeX with infix operators for the humans.<p>This was true before LLMs though.  So many people love curlies or love indentation, love 2 spaces or 4 spaces.  Programmers have been married to text files as the authoritative source, using grep to search, patches to update.  The expressions could be rows in a database.  Then finding and formatting are done as views from that.<p>> I know quite a few non-technical people that started vibe-coding this year and got good results for their ideas.<p>Me too, but a few of them hit limits.  A couple months ago, I'd say vibe coding fell apart at 2k loc or something.  It goes further now, but I think it's fragile after you take the "one shot prompt" and try to make significant changes once the pattern is set.  There's probably a way to push these limits much further out so that non-programmers can do more, focusing on what they care about, and not bogged down in programming details they don't.</p>
]]></description><pubDate>Mon, 27 Jul 2026 09:54:35 +0000</pubDate><link>https://news.ycombinator.com/item?id=49067264</link><dc:creator>xscott</dc:creator><comments>https://news.ycombinator.com/item?id=49067264</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49067264</guid></item><item><title><![CDATA[New comment by xscott in "Why care about programming languages"]]></title><description><![CDATA[
<p>Yeah, but sorting algs, FFTs, matrix factorizations, backprop, and many other things just aren't the same with purely functional data structures.<p>Maybe these well known cases could be hidden in the API, but it's easy to come up with other examples.  I forget what Clojure calls it, but they have some notion about things where they're mutable during "birth" and then locked down.<p>Someone smarter than me knows how to do this right.</p>
]]></description><pubDate>Mon, 27 Jul 2026 08:00:39 +0000</pubDate><link>https://news.ycombinator.com/item?id=49066448</link><dc:creator>xscott</dc:creator><comments>https://news.ycombinator.com/item?id=49066448</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49066448</guid></item><item><title><![CDATA[New comment by xscott in "Why care about programming languages"]]></title><description><![CDATA[
<p>> would you rather review LLM-written assembly or LLM-written Haskell?<p>I wish we had a language that was targeted specifically for LLMs to write and humans and LLMs to inspect:<p>- Simple robust syntax<p>- One obvious way to do things<p>- Static type checking<p>- Purely functional encouraged, escape hatches for performance<p>- Inspect-able, testable, and reviewable in small pieces<p>- Something like formal predicates, preconditions, post-conditions, assertions, or effects typing<p>Giving LLMs all the surface area of Python, JavaScript, TypeScript, or C++ seems like a huge mistake.  It's amazing it works as well as it does.  Well written Haskell is beautiful, but there are way too many ways to write Haskell:<p><a href="https://people.willamette.edu/~fruehr/haskell/evolution.html" rel="nofollow">https://people.willamette.edu/~fruehr/haskell/evolution.html</a></p>
]]></description><pubDate>Mon, 27 Jul 2026 06:47:55 +0000</pubDate><link>https://news.ycombinator.com/item?id=49065925</link><dc:creator>xscott</dc:creator><comments>https://news.ycombinator.com/item?id=49065925</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49065925</guid></item><item><title><![CDATA[New comment by xscott in "Why care about programming languages"]]></title><description><![CDATA[
<p>There's a lot that's worth thinking about and discussing on this topic, but it's too loaded with emotional stuff for many people to hope for a productive discussion.<p>I'm a programming languages nerd.  I was paid to program in over 20 different languages over my 25 year career.  I read up on many more languages along the way, and I wrote pet projects in a few of those.  I've written a couple assemblers, compilers, and interpreters for my own languages.<p>I think literally everyone should be taught to program in elementary school.  It's arguably one of the best ways to teach logical thought and careful organization of ideas.  I like Alan Perlis's quote:  You think you know when you can learn, are more sure when you can write, even more when you can teach, but certain when you can program.<p>With all of that out of the way, I think there are interesting questions to ask going forward:<p>If you were starting a business for a great software idea, with your own savings on the line, would you hire 10 AI hostile programmers to implement the idea or 2 AI friendly people and get them some subscriptions to the top models?  Remember: if it doesn't come together, it's YOUR money on the line.<p>What are the best programming languages for LLMs to program with?  Could someone design a better language that fits their strengths and weaknesses?  I think the most popular human languages have way too much affordance for concerns that don't apply to models.  I think letting LLMs program in human friendly languages makes the results more difficult for humans to inspect.  There's a slight chicken and egg problem based on the training sets used by large models, but this can be addressed with LoRA tuning and similar techniques for open weight models.<p>How can we make LLMs scale better so that people who don't like to program can get better "vibe coding" results?  Tools like Excel are huge force multipliers for so many people who aren't interested in writing traditional code.  I think it should be possible for non-programmers to solve their own problems and trust the results without becoming programmers.<p>Anyways, I've got my own partially formed answers to those questions, but I'd like to hear what other people who aren't still suffering stages of LLM programming grief have to say and ask.</p>
]]></description><pubDate>Mon, 27 Jul 2026 06:34:41 +0000</pubDate><link>https://news.ycombinator.com/item?id=49065855</link><dc:creator>xscott</dc:creator><comments>https://news.ycombinator.com/item?id=49065855</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49065855</guid></item><item><title><![CDATA[New comment by xscott in "Thoughts on Integers (2023)"]]></title><description><![CDATA[
<p>> Rust eliminates each of these points: all integer types have an
explicit size, and all types are prefixed with either i or u for
signed and unsigned respectively. There’s no bias towards a 
certain size or signedness.<p>Most of that paragraph is objectively false:<p><pre><code>    fn main() {
        let i = 1;
        let j = 1;
        print!("i: {:?}\n", !i);
        print!("j: {:?}\n", !j);

        // spooky action at a distance
        let v = vec![1, 2, 3];
        v[i];
    }
</code></pre>
Only a small percentage of rust programmers could explain what's going on here before compiling and running this program.  I fully expect one of the more obnoxious ones to come along any second and defend it by throwing in a lot of unrelated information and not addressing the fact this is a confusing example despite being so simple.</p>
]]></description><pubDate>Mon, 27 Jul 2026 02:35:29 +0000</pubDate><link>https://news.ycombinator.com/item?id=49064603</link><dc:creator>xscott</dc:creator><comments>https://news.ycombinator.com/item?id=49064603</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49064603</guid></item><item><title><![CDATA[New comment by xscott in "EEG shows brain can simultaneous encode two speech streams"]]></title><description><![CDATA[
<p>Singing and playing guitar was super painful for me.  Got easier after the first song, so now it's just painful to the people hearing me.<p>I remember a story about people who stutter not stuttering while singing.</p>
]]></description><pubDate>Fri, 17 Jul 2026 18:32:00 +0000</pubDate><link>https://news.ycombinator.com/item?id=48950685</link><dc:creator>xscott</dc:creator><comments>https://news.ycombinator.com/item?id=48950685</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48950685</guid></item><item><title><![CDATA[New comment by xscott in "The early History of the Singular Value Decomposition (1993) [pdf]"]]></title><description><![CDATA[
<p>And you can use a spoon to chop spaghetti into pieces.  Say I have a 10,000 by 100 matrix (1M elements), squaring that to get a 10,000 x 10,000 (100M elements) matrix to get the singular vectors is probably a bad idea.  That squares the condition number too.<p>The SVD staying in Reals when you have Real data is a nice feature.</p>
]]></description><pubDate>Sun, 12 Jul 2026 01:36:29 +0000</pubDate><link>https://news.ycombinator.com/item?id=48877506</link><dc:creator>xscott</dc:creator><comments>https://news.ycombinator.com/item?id=48877506</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48877506</guid></item><item><title><![CDATA[New comment by xscott in "The early History of the Singular Value Decomposition (1993) [pdf]"]]></title><description><![CDATA[
<p>That's like saying spoons are more flexible than forks because you have soup (rotation matrices).  Spoons and forks both work for rice (pos def matrices), and you'll want a fork for noodles (rectangular matrices).</p>
]]></description><pubDate>Sat, 11 Jul 2026 23:05:11 +0000</pubDate><link>https://news.ycombinator.com/item?id=48876692</link><dc:creator>xscott</dc:creator><comments>https://news.ycombinator.com/item?id=48876692</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48876692</guid></item><item><title><![CDATA[New comment by xscott in "Leviathan Waking – On Anthropic/USG, and a new era in AI governance"]]></title><description><![CDATA[
<p>> Imagine that there were no [...]<p>Metaphors are good as a pedagogical tool for explaining topics where you're an expert and are (within reason) certain the parallel conclusion is valid.  This can bridge the gap for students.<p>In other situations, they're a terrible argument strategy or manipulative rhetorical tactic, and the reader or listener should question every single detail if they bother to entertain it at all.<p>Are LLMs really like drugs that might hospitalize you?  Is the government actually concerned about the well being of the people?  Can you regulate LLMs as the FDA does pharmaceuticals given that they're trivially copied as files from other countries?</p>
]]></description><pubDate>Tue, 16 Jun 2026 21:26:23 +0000</pubDate><link>https://news.ycombinator.com/item?id=48562370</link><dc:creator>xscott</dc:creator><comments>https://news.ycombinator.com/item?id=48562370</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48562370</guid></item><item><title><![CDATA[New comment by xscott in "Did Anthropic ask for this?"]]></title><description><![CDATA[
<p>It's tough to know who believes what at that level, because if they are aiming for regulatory capture they need to maintain the illusion.</p>
]]></description><pubDate>Sun, 14 Jun 2026 23:28:51 +0000</pubDate><link>https://news.ycombinator.com/item?id=48534216</link><dc:creator>xscott</dc:creator><comments>https://news.ycombinator.com/item?id=48534216</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48534216</guid></item><item><title><![CDATA[New comment by xscott in "Did Anthropic ask for this?"]]></title><description><![CDATA[
<p>Another neutral party might not believe it's really a doomsday device and that what currently looks like exponential growth in capability could be an s-curve that plateaus in a year or two.  After that, it will be diminishing returns to invest heavily into a tech that won't get much better.<p>So what are the current leaders in the field supposed to do to stave off competition?  They should convince the public that they do have a doomsday device, claim it must be regulated, and then they can profit from their duopoly because it's exceedingly expensive to break into the high end of the market.  The government has its own nefarious incentives, not limited to collecting fees and using the unrestricted versions for surveillance or black hat stuff.</p>
]]></description><pubDate>Sun, 14 Jun 2026 23:17:47 +0000</pubDate><link>https://news.ycombinator.com/item?id=48534073</link><dc:creator>xscott</dc:creator><comments>https://news.ycombinator.com/item?id=48534073</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48534073</guid></item><item><title><![CDATA[New comment by xscott in "Go: Support for Generic Methods"]]></title><description><![CDATA[
<p>> you see the point, right?<p>Bah, I think this debate was already old when I first saw people arguing it on comp.lang.lisp in the 90s.  I don't have a dog in this fight other than to reject the notion that Common Lisp is "coherent" and not "organically grown".<p>The original Scheme belongs in the category of languages like Standard ML and SmallTalk, where a small, careful, and talented group designed them with focus.  Common Lisp seems like a bunch of smart people with competing interest and legacy baselines tried to meet in the middle.  To the extent CL is more pragmatic, it's another example of "Worse is Better".</p>
]]></description><pubDate>Wed, 27 May 2026 22:39:22 +0000</pubDate><link>https://news.ycombinator.com/item?id=48301730</link><dc:creator>xscott</dc:creator><comments>https://news.ycombinator.com/item?id=48301730</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48301730</guid></item><item><title><![CDATA[New comment by xscott in "Go: Support for Generic Methods"]]></title><description><![CDATA[
<p>Heh, I'd probably take R4RS with define-syntax :-)</p>
]]></description><pubDate>Wed, 27 May 2026 13:33:52 +0000</pubDate><link>https://news.ycombinator.com/item?id=48294122</link><dc:creator>xscott</dc:creator><comments>https://news.ycombinator.com/item?id=48294122</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48294122</guid></item></channel></rss>