<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: tbct</title><link>https://news.ycombinator.com/user?id=tbct</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Fri, 09 Oct 2026 05:24:07 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=tbct" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by tbct in "GPT‑6 and Intelligent UI for everyone"]]></title><description><![CDATA[
<p>In case you or anyone else in this thread hasn't come across it, <a href="https://www.recipesource.com/" rel="nofollow">https://www.recipesource.com/</a> is basically the same but curated.</p>
]]></description><pubDate>Thu, 08 Oct 2026 08:52:32 +0000</pubDate><link>https://news.ycombinator.com/item?id=50003422</link><dc:creator>tbct</dc:creator><comments>https://news.ycombinator.com/item?id=50003422</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=50003422</guid></item><item><title><![CDATA[New comment by tbct in "The Origins of Scala (2009)"]]></title><description><![CDATA[
<p>Can you elaborate on what you're referring to? I can see performance becoming a problem if you repeatedly chain non-optimisable (in bytecode) as excluding the in place operations I believe all ops re-allocate the collection.</p>
]]></description><pubDate>Sat, 29 Nov 2025 21:44:56 +0000</pubDate><link>https://news.ycombinator.com/item?id=46091072</link><dc:creator>tbct</dc:creator><comments>https://news.ycombinator.com/item?id=46091072</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46091072</guid></item><item><title><![CDATA[New comment by tbct in "Address of Pope Leo XIV to the College of Cardinals"]]></title><description><![CDATA[
<p>David Autor was recently interviewed by Martin Wolf on the effect of AI on jobs. The question of if its fair to compare a possible economic shock on knowledge work to the China shock in manufacturing. He had two responses to the question:<p>1. The geographic dispersal of knowledge work should allow retraining of displaced workers, in opposition to the loss of manufacturing jobs which centre around single employer towns.<p>2. The china shock resulted in a sudden drop in prices, whereas AI would lead to efficiency gains.<p>The second point, to me, feels more pertinent, and mixed with the first could allow for a freeing up of labour, ideally into higher value add work. I think the time horizon is also worth speaking about here, as most economists will be thinking in 5-10 years where we can expect substantial improvements in models, but barring new model architecutre, it seems doubtful that we'll see some sort of emergent intelligence from LLMs.<p>Post-ASI, knowledge labour necessarily has zero value, at which point the challenge is to design an equitable society.<p>The full interview is fairly interesting in itself: <a href="https://www.ft.com/content/4e260abd-2528-4d34-8fa4-a21eabfd6db9" rel="nofollow">https://www.ft.com/content/4e260abd-2528-4d34-8fa4-a21eabfd6...</a></p>
]]></description><pubDate>Sat, 10 May 2025 23:07:01 +0000</pubDate><link>https://news.ycombinator.com/item?id=43949743</link><dc:creator>tbct</dc:creator><comments>https://news.ycombinator.com/item?id=43949743</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=43949743</guid></item><item><title><![CDATA[New comment by tbct in "Programming languages should have a tree traversal primitive"]]></title><description><![CDATA[
<p>Once you have algebraic data-types in a language, writing a recursive visitor pattern is pretty simple.<p>Encoding the semantics of a tree traversal operator likewise is difficult in the general case. What exactly would the order be, what if I want to traverse in a non-standard ordering, what about skipping branches; all would be difficult to cleanly represent.<p>I have seen it done where you return actions with key ones being recurse, stop, replace, and replace & then carry out some function, but again, this is pretty simple to implement.</p>
]]></description><pubDate>Tue, 29 Apr 2025 14:07:32 +0000</pubDate><link>https://news.ycombinator.com/item?id=43832873</link><dc:creator>tbct</dc:creator><comments>https://news.ycombinator.com/item?id=43832873</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=43832873</guid></item><item><title><![CDATA[New comment by tbct in "Types are a basic tool of software design (2018)"]]></title><description><![CDATA[
<p>Surely, however from a software architecture perspective types as contracts, assuming pure functions and maximally restrictive types, is a good model for reasoning about a system. A function such as:<p>addIfEven: Int -> Int -> Maybe Int<p>even without knowledge of the implementation lets us know our caller has 'entered into a contract' where addIfEven will reduce two integers depending on some conditions. This contract then becomes two-wayed: If I modify the implementation of the function there's a good chance I'll be forced to modify the signature, thereby letting me know statically that I've broken the contract with the callsite.<p>I'd recommend checking out <a href="https://lexi-lambda.github.io/blog/2020/08/13/types-as-axioms-or-playing-god-with-static-types/" rel="nofollow">https://lexi-lambda.github.io/blog/2020/08/13/types-as-axiom...</a> for a far better write-up than this comment on why type-driven development is like unlocking a cheat-code for development.</p>
]]></description><pubDate>Sat, 04 Jan 2025 10:24:28 +0000</pubDate><link>https://news.ycombinator.com/item?id=42593866</link><dc:creator>tbct</dc:creator><comments>https://news.ycombinator.com/item?id=42593866</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=42593866</guid></item><item><title><![CDATA[New comment by tbct in "Linear Algebra Done Right [pdf]"]]></title><description><![CDATA[
<p>Surprisingly one of the best summaries (~10 pages) to applied linear algebra I've found is in Nielsen and Chuang's Quantum Computation and Quantum Information.<p>Presented primarily without proofs which whilst argubably can be limiting isn't relevant, at least for what their goal is.</p>
]]></description><pubDate>Sun, 01 Sep 2024 18:11:39 +0000</pubDate><link>https://news.ycombinator.com/item?id=41418939</link><dc:creator>tbct</dc:creator><comments>https://news.ycombinator.com/item?id=41418939</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=41418939</guid></item></channel></rss>