<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: nwhitehead</title><link>https://news.ycombinator.com/user?id=nwhitehead</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Mon, 08 Jun 2026 16:10:57 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=nwhitehead" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by nwhitehead in "Ask HN: What was your "oh shit" moment with GenAI?"]]></title><description><![CDATA[
<p>(Spouse's story)<p>Today I used Claude to diagnose a blocking bug in a Steam game I <i>really</i> wanted to play. It took it 18 mins, but it unpacked the Godot package, figured out the bug, proposed a fix, and gave me an in game workaround.<p>I didn't have to do anything! Claude figured out the structure of the .pck file by using `strings`, then wrote some Python code with some magic Godot-specific code to unpack the specific chunks it needed.</p>
]]></description><pubDate>Sat, 06 Jun 2026 05:22:24 +0000</pubDate><link>https://news.ycombinator.com/item?id=48421652</link><dc:creator>nwhitehead</dc:creator><comments>https://news.ycombinator.com/item?id=48421652</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48421652</guid></item><item><title><![CDATA[New comment by nwhitehead in "How to build a solar powered electric oven"]]></title><description><![CDATA[
<p>This is fun, I'm curious to try it.<p>An alternative that I experimented with and found to be very usable is one solar panel, a small camping battery ("portable power station"), and an Instant Pot. The total cost is not super high. The Instant Pot is power efficient and can cook a lot of food at once. Since it's battery powered you can start any time the battery is charged.</p>
]]></description><pubDate>Sun, 02 Nov 2025 04:05:07 +0000</pubDate><link>https://news.ycombinator.com/item?id=45787785</link><dc:creator>nwhitehead</dc:creator><comments>https://news.ycombinator.com/item?id=45787785</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45787785</guid></item><item><title><![CDATA[New comment by nwhitehead in "Does Reasoning Emerge? Probabilities of Causation in Large Language Models"]]></title><description><![CDATA[
<p>You would think so...<p>I asked this question in a college-level class with clickers. For the initial question I told them, "This is a trick question, your first answer might not be right". Still less than 10% of students got the right answer.</p>
]]></description><pubDate>Fri, 16 Aug 2024 22:32:13 +0000</pubDate><link>https://news.ycombinator.com/item?id=41270980</link><dc:creator>nwhitehead</dc:creator><comments>https://news.ycombinator.com/item?id=41270980</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=41270980</guid></item><item><title><![CDATA[New comment by nwhitehead in "Researchers taking on fraudulent science"]]></title><description><![CDATA[
<p>One idea is to put more pressure on writers of letters of recommendation. There is obviously already some rather weak "reputational incentive" to not give letters of recommendation to fraudsters. But it could be made a more formal policy. Letters could be required to include a statement about the candidate adhering to various formalized "good behavior" policies. Then when fraud happens there could be actual consequences for the letter writer. This would be like the culture in software development where you don't blame people for writing bad code, you blame reviewers for letting in bad code. (Idea comes from Angela Collier, in relation to other forms of antisocial behavior).</p>
]]></description><pubDate>Sun, 04 Feb 2024 00:44:56 +0000</pubDate><link>https://news.ycombinator.com/item?id=39246318</link><dc:creator>nwhitehead</dc:creator><comments>https://news.ycombinator.com/item?id=39246318</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=39246318</guid></item><item><title><![CDATA[New comment by nwhitehead in "In-browser code playgrounds"]]></title><description><![CDATA[
<p>I like how you can handle lots of languages in a very systematic way, that is cool.<p>One thing I like about pyodide is that it supports lots of packages like numpy. How would you support packages like this with a WASI approach?</p>
]]></description><pubDate>Sat, 06 Jan 2024 16:04:44 +0000</pubDate><link>https://news.ycombinator.com/item?id=38892518</link><dc:creator>nwhitehead</dc:creator><comments>https://news.ycombinator.com/item?id=38892518</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=38892518</guid></item><item><title><![CDATA[New comment by nwhitehead in "DeciLM-7B: The Fastest and Most Accurate 7B-Parameter LLM to Date"]]></title><description><![CDATA[
<p>I'm using the new generation of small models to do semantic search for music lyrics. The first step is giving the model the text and asking, "What is this text about?" Without fine-tuning and only minimal prompt engineering these models can understand most languages, pull out the most relevant phrases, and list major themes and speculative ideas of what the lyrics mean. I'm super impressed with the results. Reading the answers feels like grading ambitious undergraduate student essays (both the good and the bad).</p>
]]></description><pubDate>Tue, 12 Dec 2023 16:47:49 +0000</pubDate><link>https://news.ycombinator.com/item?id=38614679</link><dc:creator>nwhitehead</dc:creator><comments>https://news.ycombinator.com/item?id=38614679</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=38614679</guid></item><item><title><![CDATA[New comment by nwhitehead in "Ask HN: What is the best money you have spent on professional development?"]]></title><description><![CDATA[
<p>This is a good one. It is all too easy to spend years casually "interested" in a topic without developing a true foundation of the important ideas in the field.<p>In my case I spent two decades casually reading about economics. But then one day I ordered an economics textbook to work through the problems, and found out that I basically knew nothing and couldn't do any of the problems. A few months of slowly working through the textbook gave me a much deeper level of understanding. I could do the problems now.</p>
]]></description><pubDate>Wed, 18 Nov 2020 17:09:39 +0000</pubDate><link>https://news.ycombinator.com/item?id=25139329</link><dc:creator>nwhitehead</dc:creator><comments>https://news.ycombinator.com/item?id=25139329</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=25139329</guid></item><item><title><![CDATA[New comment by nwhitehead in "Band-Limiting Procedural Textures"]]></title><description><![CDATA[
<p>This is awesome! This reminds me of MinBLEP audio synthesis of discontinuous functions (<a href="https://www.cs.cmu.edu/~eli/papers/icmc01-hardsync.pdf" rel="nofollow">https://www.cs.cmu.edu/~eli/papers/icmc01-hardsync.pdf</a>). Instead of doing things at high sampling rate and explicitly filtering, generate the band-limited version directly.<p>In the article, talking about smoothstep approximation of sinc: "I'd argue the smoothstep version looks better" Why would this be? I would have thought the theoretically correct sinc version would look nicer.</p>
]]></description><pubDate>Thu, 27 Aug 2020 16:50:43 +0000</pubDate><link>https://news.ycombinator.com/item?id=24295605</link><dc:creator>nwhitehead</dc:creator><comments>https://news.ycombinator.com/item?id=24295605</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=24295605</guid></item><item><title><![CDATA[New comment by nwhitehead in "GitHub Classroom"]]></title><description><![CDATA[
<p>Agree, automated testing is good as far as it goes but really shouldn't be the whole story with grading.<p>Another fun tool is CrowdGrader (<a href="https://www.crowdgrader.org/" rel="nofollow">https://www.crowdgrader.org/</a>). It's a nice way to distribute reviewing/grading throughout the class to make it more scalable. When I was teaching I really liked it, it meant I could assign more interesting creative assignments at a faster pace. It's a different type of "automation".</p>
]]></description><pubDate>Thu, 04 Jun 2020 17:05:23 +0000</pubDate><link>https://news.ycombinator.com/item?id=23419095</link><dc:creator>nwhitehead</dc:creator><comments>https://news.ycombinator.com/item?id=23419095</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=23419095</guid></item><item><title><![CDATA[New comment by nwhitehead in "Streaming: a skill gap?"]]></title><description><![CDATA[
<p>My favorite is Welford's Algorithm [1] which lets you compute mean and standard deviation in one pass. Every programmer should be aware of it.<p>[1]: <a href="https://en.wikipedia.org/wiki/Algorithms_for_calculating_variance" rel="nofollow">https://en.wikipedia.org/wiki/Algorithms_for_calculating_var...</a></p>
]]></description><pubDate>Mon, 03 Feb 2020 21:54:12 +0000</pubDate><link>https://news.ycombinator.com/item?id=22229625</link><dc:creator>nwhitehead</dc:creator><comments>https://news.ycombinator.com/item?id=22229625</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=22229625</guid></item><item><title><![CDATA[New comment by nwhitehead in "French ISPs Ordered to Block Sci-Hub and LibGen"]]></title><description><![CDATA[
<p>OLGA was full of transcribed songs, great for learning guitar. Now it's gone.<p><a href="https://en.wikipedia.org/wiki/On-line_Guitar_Archive" rel="nofollow">https://en.wikipedia.org/wiki/On-line_Guitar_Archive</a></p>
]]></description><pubDate>Tue, 02 Apr 2019 17:14:54 +0000</pubDate><link>https://news.ycombinator.com/item?id=19556416</link><dc:creator>nwhitehead</dc:creator><comments>https://news.ycombinator.com/item?id=19556416</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=19556416</guid></item><item><title><![CDATA[New comment by nwhitehead in "Eminent Philosophers Name the Most Important Philosophy Books from 1950-2000"]]></title><description><![CDATA[
<p>I would recommend all the works by Robert Nozick, listed at #14 on the list for "Anarchy, State and Utopia". While that might be his most influential book, I found his other books more fun to read.</p>
]]></description><pubDate>Tue, 17 Apr 2018 18:15:37 +0000</pubDate><link>https://news.ycombinator.com/item?id=16860877</link><dc:creator>nwhitehead</dc:creator><comments>https://news.ycombinator.com/item?id=16860877</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=16860877</guid></item><item><title><![CDATA[New comment by nwhitehead in "Ask HN: How and where can I publish my research on AI as a college dropout?"]]></title><description><![CDATA[
<p>Steps to publishing your research:<p>-Do a literature survey and read LOTS of papers. If you are not coming from the standard academic route you are probably vastly underestimating how much existing work has been published. To publish your research you need to place it in the right context, with citations, and really understand what is novel about your ideas. Read lots of papers, take notes, keep track of the bibliographic details. Follow up on citations to find more papers.<p>-Write up your understanding of the relevant field as a survey of existing literature with citations. This will clarify your thinking and help you become familiar with standard terminology. This will also be part of your finished paper.<p>-Write up your idea using terminology and notation consistent with your existing survey. Discuss what is novel and different about your idea.<p>-Analyze your idea from the point of view of other paradigms. Answer possible critiques that would come from other ways of thinking about the same problem. If you've discovered "standard" ways of evaluating your type of idea, do the evaluation to see how you compare.<p>-Get feedback. Get opinions from as many other people as you can that are as good as you can find. In the draft paper, thank everyone that gives you any feedback. If people give you substantial ideas that improve the work, ask if they want to be co-authors and work with you a bit more.<p>-Once you feel there is a real research contribution in your paper draft, and people you have shown it to think it is good, start working on getting it published. Put it up on preprint sites and send it to conferences or journals that are relevant. By this point you should know the right venues based on your survey work.</p>
]]></description><pubDate>Mon, 09 Oct 2017 18:10:16 +0000</pubDate><link>https://news.ycombinator.com/item?id=15436102</link><dc:creator>nwhitehead</dc:creator><comments>https://news.ycombinator.com/item?id=15436102</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=15436102</guid></item><item><title><![CDATA[DungeonScript, a first-person version of PuzzleScript]]></title><description><![CDATA[
<p>Article URL: <a href="http://farbs.org/dungeonscript">http://farbs.org/dungeonscript</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=14817215">https://news.ycombinator.com/item?id=14817215</a></p>
<p>Points: 2</p>
<p># Comments: 0</p>
]]></description><pubDate>Fri, 21 Jul 2017 00:10:25 +0000</pubDate><link>http://farbs.org/dungeonscript</link><dc:creator>nwhitehead</dc:creator><comments>https://news.ycombinator.com/item?id=14817215</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=14817215</guid></item><item><title><![CDATA[New comment by nwhitehead in "Searching for fast complex numbers in C99 and C++"]]></title><description><![CDATA[
<p>> If you’re relying on c99 complex or std::complex and fast complex operations, and you don’t have -fcx-limited-range or -ffast-math turned on, you should probably consider this a bug in your project.<p>I would rephrase this as, "If you care about floating point performance and have not investigated the compiler flags related to floating point performance, consider this a bug in your project."</p>
]]></description><pubDate>Wed, 19 Jul 2017 16:28:23 +0000</pubDate><link>https://news.ycombinator.com/item?id=14805496</link><dc:creator>nwhitehead</dc:creator><comments>https://news.ycombinator.com/item?id=14805496</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=14805496</guid></item><item><title><![CDATA[New comment by nwhitehead in "Why didn't Larrabee fail?"]]></title><description><![CDATA[
<p>This is fun to read, I'm always amazed as the disconnect between public presentations and the engineering reality of what's really going on.<p>For me, "Larrabee" died during it's first public demo in IDF 2009 [1]. At the time I was working on CUDA libraries at NVIDIA. I remember everyone watching the stream to see how much of a threat it would be. When we saw the actual graphics, everyone started laughing. "Welcome to the 1990s!" At that point it was obvious that Larrabee would not be a graphics threat to NVIDIA, it just had too far to go. It was not a discrete GPU killer.<p>[1]: <a href="https://www.youtube.com/watch?v=G-FKBMct21g" rel="nofollow">https://www.youtube.com/watch?v=G-FKBMct21g</a></p>
]]></description><pubDate>Mon, 15 Aug 2016 23:09:26 +0000</pubDate><link>https://news.ycombinator.com/item?id=12294217</link><dc:creator>nwhitehead</dc:creator><comments>https://news.ycombinator.com/item?id=12294217</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=12294217</guid></item><item><title><![CDATA[New comment by nwhitehead in "Jonathan Blow's new game, The Witness, is out"]]></title><description><![CDATA[
<p>What's wrong with sequence A096774 (numbers with 9*10^n+7 prime)? Why is sequence A000027 (numbers starting at 1 increasing by 1 each time) better? Because it comes earlier in the encyclopedia of sequences?</p>
]]></description><pubDate>Thu, 28 Jan 2016 18:13:29 +0000</pubDate><link>https://news.ycombinator.com/item?id=10989998</link><dc:creator>nwhitehead</dc:creator><comments>https://news.ycombinator.com/item?id=10989998</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=10989998</guid></item><item><title><![CDATA[New comment by nwhitehead in "Cruncher: An Implementation of Bret Victor's Scrubbing Calculator"]]></title><description><![CDATA[
<p>I'm solving "2^... = 256" and it gives NaN. It works when the right hand side is smaller than 200 but fails when the right side is larger than 242.</p>
]]></description><pubDate>Wed, 13 Jan 2016 18:29:32 +0000</pubDate><link>https://news.ycombinator.com/item?id=10896363</link><dc:creator>nwhitehead</dc:creator><comments>https://news.ycombinator.com/item?id=10896363</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=10896363</guid></item><item><title><![CDATA[New comment by nwhitehead in "Symbolic expressions can be automatically differentiated too"]]></title><description><![CDATA[
<p>This example makes it really clear what's going on. Could someone translate it to do reverse automatic differentiation? That's the one I never quite understand.</p>
]]></description><pubDate>Fri, 08 Jan 2016 23:53:46 +0000</pubDate><link>https://news.ycombinator.com/item?id=10869229</link><dc:creator>nwhitehead</dc:creator><comments>https://news.ycombinator.com/item?id=10869229</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=10869229</guid></item><item><title><![CDATA[New comment by nwhitehead in "0.30000000000000004"]]></title><description><![CDATA[
<p>This might be true on really weird platforms, but with IEEE-754 floating point this isn't true. Integers within a big range are exactly representable without any rounding error. Doing floor((float(13) + float(13))/2.0) should be exactly 13. It is entirely possible that the weird platform was supposed to be using IEEE-754 arithmetic but had a buggy math library (depressingly common).</p>
]]></description><pubDate>Fri, 13 Nov 2015 18:18:45 +0000</pubDate><link>https://news.ycombinator.com/item?id=10561361</link><dc:creator>nwhitehead</dc:creator><comments>https://news.ycombinator.com/item?id=10561361</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=10561361</guid></item></channel></rss>