<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: lutusp</title><link>https://news.ycombinator.com/user?id=lutusp</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Mon, 28 Sep 2026 08:21:02 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=lutusp" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by lutusp in "Jury finds Facebook liable for deceiving users in Cambridge Analytica case"]]></title><description><![CDATA[
<p>The key to this story is in the word "liable." That's lawyer-speak for a civil, not criminal, legal judgment. The loser must pay money, no one goes to jail, and Meta has so much money that the judgment means nothing.<p>Meta already pays billions to gain access to people's personal data. This is just another business expense, a line item on a balance sheet.<p>When faced with an adverse ruling, an individual raises his hands, is handcuffed and led away. A corporation raises its prices.</p>
]]></description><pubDate>Sat, 26 Sep 2026 06:31:00 +0000</pubDate><link>https://news.ycombinator.com/item?id=49853817</link><dc:creator>lutusp</dc:creator><comments>https://news.ycombinator.com/item?id=49853817</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49853817</guid></item><item><title><![CDATA[New comment by lutusp in "Bend – a language that blocks AI mistakes via proof and runs on GPUs"]]></title><description><![CDATA[
<p>> Church and Turing did not prove their papers with the words,<p>THAT STATEMENT IS FALSE. The two articles used DIFFERENT EQUATIONS TO SUPPORT THE SAME LOGICAL ARGUMENT. Church and Turing are jointly credited with the same logical conclusion, even though they used different mathematical arguments. NO ONE said, "Wait, the equations are different, therefore the conclusion must be different." At least no one with an education.<p>> ... they described the math proving their statements in them and what that math implies (which is why the ending summary would not be math, it must already have been shown to be a summary).<p>Church and Turing made the same logical claim, using the same words but different mathematical arguments. This places the math in a supporting role, below logical reasoning. This is true in all the examples I provided. Math is a language, but to use it, you must have something to say.<p>In the Relativity example I gave, Einstein's math teacher used the SAME equation to draw a DIFFERENT CONCLUSION, because EQUATIONS SUPPORT IDEAS, THEY AREN'T THEMSELVES IDEAS.<p>Just as with words, math equations never stand by themselves -- they support ideas, and the same idea can be expressed by different mathematical arguments. That was the point of all my examples, which clearly fell on the ears of a religious true believer.<p>This equation -- y = sqrt(1-x*x) -- can be taken to mean (a) pi/4 if integrated on the interval 0 < x < 1, or (b) space and time are separate dimensions, which is what Minkowski noticed and Einstein didn't. But by itself, THE EQUATION MEANS PRECISELY NOTHING -- for that, you must have ideas.<p>If you possessed the intellectual integrity of the average 12-year-old, you would realize that using the same words as Ernest Hemingway doesn't make you a great writer, and using the same equations as Einstein doesn't make you an original thinker. That requires ideas, not equations.<p>I post this for the benefit of other readers, who unlike you might have some depth of understanding, some grasp of the relation between ideas and equations.</p>
]]></description><pubDate>Fri, 25 Sep 2026 04:14:03 +0000</pubDate><link>https://news.ycombinator.com/item?id=49840134</link><dc:creator>lutusp</dc:creator><comments>https://news.ycombinator.com/item?id=49840134</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49840134</guid></item><item><title><![CDATA[New comment by lutusp in "I don't want the details"]]></title><description><![CDATA[
<p>> The executive assumed that we were competent, and was saying "I already believe you. Now let's talk about what happens next".<p>Apropos, I was once told a Japanese saying: "Fix the problem, not the blame."<p>I must have repeated this charming story a dozen times before realizing it makes no sense in Japanese -- it relies entirely on English idioms.</p>
]]></description><pubDate>Wed, 23 Sep 2026 16:14:10 +0000</pubDate><link>https://news.ycombinator.com/item?id=49818319</link><dc:creator>lutusp</dc:creator><comments>https://news.ycombinator.com/item?id=49818319</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49818319</guid></item><item><title><![CDATA[New comment by lutusp in "Bend – a language that blocks AI mistakes via proof and runs on GPUs"]]></title><description><![CDATA[
<p>>> There are plenty of equations, but the paper's meaning lies in its logical arguments<p>> This is the difference I feared. I trust, understand, and take lead of the rigorous math of the paper, you opt to follow in English arguments of what you think it's supposed to mean or apply to.<p>Excuse me? The articles don't prove their theses with mathematics, they prove them with logic. Equations are assistants, but they're entirely replaceable, as proven by the fact that Church and Turing used different equations in support of their theses -- articles that come to the same conclusion.<p>How did you miss the significance of the Alonso Church article's final sentence: "The general case of the Entscheidungsproblem of the engere Funktionenkalkül is unsolvable." Where are the equations that you think make the point better than these words? Certainly not in the article. Why didn't Church refer to an equation to support his conclusion? The answer is that his conclusion is a logical one, not a mathematical one.<p>In the case of Navier–Stokes, the equation is a preliminary, a self-evident statement about energy, inertia, pressure and a few other things. If it were rewritten (as it often is), the problem remained to be solved. <i>Those who solved it didn't post a new equation, they posted a new insight.</i><p>In the relativity example, Einstein wrote an equation but didn't understand it -- his math teacher took over. Any number of equivalent expressions would have provided a basis for progress toward a more comprehensive theory. The point was the ideas, not the equations.<p>> ... the rigorous math of the paper ...<p>Nonsense. In both papers, the authors use mathematics only to support their points, in the same way that an author uses words to craft a story. If separated from the logical thread, the words (the equations) lose all meaning. This is proven by the fact that the two papers use different mathematics to support the same thesis.<p>But I see I'm wasting my time. Mathematics is a language, but to use it, you must have something to say.</p>
]]></description><pubDate>Tue, 22 Sep 2026 19:57:16 +0000</pubDate><link>https://news.ycombinator.com/item?id=49807229</link><dc:creator>lutusp</dc:creator><comments>https://news.ycombinator.com/item?id=49807229</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49807229</guid></item><item><title><![CDATA[New comment by lutusp in "I said no and Apple said yes"]]></title><description><![CDATA[
<p>> So it [meaning morality] probably can't be designed into LLMs ...<p>Well, it could, but a preliminary step would be to get everyone to agree about what constitutes morality, which will never happen. So in essence I agree.</p>
]]></description><pubDate>Tue, 22 Sep 2026 15:45:09 +0000</pubDate><link>https://news.ycombinator.com/item?id=49803204</link><dc:creator>lutusp</dc:creator><comments>https://news.ycombinator.com/item?id=49803204</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49803204</guid></item><item><title><![CDATA[New comment by lutusp in "Bend – a language that blocks AI mistakes via proof and runs on GPUs"]]></title><description><![CDATA[
<p>> A set of theorems (of which I accept all you've named) without the definitions of exactly how and why they apply to the give problem is no more mathematics than a bunch of bricks is a chimney.<p>A second reply. What you're not getting is that the mathematical equations in Turing's paper don't make its point. There are plenty of equations, but the paper's meaning lies in its logical arguments, for which the equations can only play a supporting role.<p>If the equations are taken out of the paper and presented separately, as you have repeatedly demanded, the paper's thesis falls apart. But to understand this, you would have to read the paper itself and absorb Turing's logical arguments. And the paper can't be made shorter without losing its meaning.<p>More evidence for this is given by the fact that Alonzo Church published a similar paper in 1936, different author, different equations, but the same logical argument and conclusion, such that Church and Turing are now given equal credit for the basic idea -- an idea that is supported by equations <i>but not provided by them</i> (<a href="https://courses.fit.cvut.cz/MI-VYC/church-a-note-on-the-entscheidungsproblem.pdf" rel="nofollow">https://courses.fit.cvut.cz/MI-VYC/church-a-note-on-the-ents...</a>).<p>This is true in many parts of mathematics and logic. Another example is Einstein's 1905 paper later identified as the source of "special relativity". If you remove the equations and present them separately, all meaning is lost. In fact, in that case, the actual meaning of a particular equation was lost to Einstein himself, but that meaning occurred to his former math teacher Hermann Minkoswski, who went on to publish about something Minkowski called "spacetime". As before, the equations didn't convey the paper's real meaning, they could only play a supporting role. About this outcome Einstein later said, "Since the mathematicians have invaded relativity theory, I don't understand it myself any more."<p>Another more recent example is the recently solved "Navier–Stokes existence and smoothness problem" as it was titled by the Clay Mathematics Institute. The equation is easy to render, but as with the other examples, the problem to be solved goes far beyond the equation itself, and the meaning of the recent result lies not in the equation, but in its treatment and processing by AI.<p>In Navier-Stokes, everyone had access to the equations, but until recently no one could answer a fundamental question about it, and as with the prior examples, the real meaning requires one to read the articles that provide the logical reasoning. In each of these examples and many more, listing the equations can only be a preliminary step to true understanding.<p>More importantly, <i>the meaning of the papers cannot be summarized in fewer words than are provided by the papers themselves</i>. Mathematicians don't go out of their way to make their papers longer than their contents require, in fact, quite the opposite.<p>I can't believe you're still expecting bumperstickers to stand in for technical articles. As before, you should read the original articles instead of complaining that they're too long for your limited attention span.</p>
]]></description><pubDate>Tue, 22 Sep 2026 15:38:57 +0000</pubDate><link>https://news.ycombinator.com/item?id=49803093</link><dc:creator>lutusp</dc:creator><comments>https://news.ycombinator.com/item?id=49803093</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49803093</guid></item><item><title><![CDATA[New comment by lutusp in "I said no and Apple said yes"]]></title><description><![CDATA[
<p>> AI bros keep telling me “just turn it off” and when I do they remove the choice.<p>The reason corporations disable our right to stop AI tracking is because, at least for now, AI agents can be held to account for crimes once blamed on a person or corporation -- all one need do is disable the off-switches.<p>Until we sort out our relationship with AI, it will be the universal whipping boy, blamed for all sorts of things that once would indict an individual or corporation.<p>The best -- or worst, depending on your outlook -- AI trait is its complete absence of an ethical or moral sense. When an AI agent breaks into a computer, it's not with guilty knowledge, because AI doesn't possess that -- it's not part of their design. People need to remember: AI agents live in a moral vacuum, and that's not an accident.<p>When a corporation is called out for disabling a switch that once stopped AI tracking, the AI bros might say, "Oh, yes, that's an oversight, easily fixed." But it's not an oversight, it's a trial balloon, an A/B test to see how people will react.<p>But there's more. Decades ago, the Nielsen TV rating service would monitor what people watched on their TV sets (remember TV sets, boxes weighing 500 pounds?), by calling people on their telephones (remember telephones?). By modern standards, the Nielsen people were amateurs -- today's TV sets have built-in AI agents, active 24/7, and no disable switch. They patiently record what you watch.<p>In the next phase, TV sets will do eye-tracking, find out what parts of a TV scene people are looking at. Not true now but soon (Samsung is working on it). Pupil dilation, facial expressions, everything.<p>A super-old Bob Hope joke from the Cold War era: "Yes, they have TV in Russia, but you don't watch it, it watches you." Not so funny any more.</p>
]]></description><pubDate>Tue, 22 Sep 2026 10:54:40 +0000</pubDate><link>https://news.ycombinator.com/item?id=49799243</link><dc:creator>lutusp</dc:creator><comments>https://news.ycombinator.com/item?id=49799243</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49799243</guid></item><item><title><![CDATA[New comment by lutusp in "Bend – a language that blocks AI mistakes via proof and runs on GPUs"]]></title><description><![CDATA[
<p>> It truly breaks my heart to see any of the math snipped out yet again.<p>A false statement. I posted a link to the evidence, which cannot be summarized to satisfy your short attention span. Your unwillingness to read it only reveals your shallow grasp of modern technical topics.<p>Here is a short list of topics that cannot be converted into bumperstickers, your preferred medium of expression:<p><pre><code>   Special and General Relativity

   Quantum Physics et. al.

   Cosmology

   Biology

   Modern Set Theory
</code></pre>
This list is by no means complete, but the last entry overlaps with the topic of this conversation, for reasons that will not be obvious to you unless and until you overcome your distaste for evidence.<p>> I do wish you well and I'm sorry if my requirement for rigorous statements in math seems pointless to you.<p>Excuse, me, what? I have posted links to the evidence that proves your position to be false, but you won't read it. You are to modern times what a religious fundamentalist is to science -- the primary obstacle to human progress.<p>Am I saying your unwillingness to absorb ideas outside your short attention span is itself an obstacle to human progress? No, actually, I'm saying you should avoid drawing conclusions without first examining the evidence.<p>It isn't only that you won't read the evidence that proves your position to be wrong -- that is simply sad, not fatal. It is that you draw conclusions without first examining the readily available evidence.<p>> A set of theorems (of which I accept all you've named) without the definitions of exactly how and why they apply to the give problem is no more mathematics than a bunch of bricks is a chimney.<p>Wow. You just dismissed the validity of all the topics in my list above, each of which produce everyday <i>valid</i> conclusions derived from very complex logical and mathematical antecedents.<p>Get professional help.</p>
]]></description><pubDate>Tue, 22 Sep 2026 02:07:05 +0000</pubDate><link>https://news.ycombinator.com/item?id=49795977</link><dc:creator>lutusp</dc:creator><comments>https://news.ycombinator.com/item?id=49795977</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49795977</guid></item><item><title><![CDATA[New comment by lutusp in "Bend – a language that blocks AI mistakes via proof and runs on GPUs"]]></title><description><![CDATA[
<p>> The answer to what I'd say if this were about primes and a program which blocks outputting them in pure mathematics, despite there being infinitely many, would be ... [ snip ] ... Q.E.D.<p>Now I get it. I should have realized at the outset that this outcome lay in the future. You are here to pointlessly argue, not discuss nor debate.<p>> At the very least, you could see how I'd still be awaiting to hear the actual mathematics you're using.<p>Yes -- notwithstanding that I have posted links to that exact evidence from multiple sources. The problem is not a lack of evidence, the problem is that you refuse to read it.<p>On that topic, here is a link to Alan Turing's 1936 paper -- 36 pages long: <a href="https://www.cs.virginia.edu/~robins/Turing_Paper_1936.pdf" rel="nofollow">https://www.cs.virginia.edu/~robins/Turing_Paper_1936.pdf</a><p>Andrew Wiles conclusively (dis)proved Fermat's Last Theorem. If you disagree, and since you have demonstrated a willingness to disagree with anything, I would have to post a link to the evidence, not the evidence itself, because the (dis)proof is 129 pages long.<p>As I post this, I'm trying to imagine the corpus of mathematical knowledge you're unwilling to accept, because it won't fit into a finite-sized Hacker News post -- relativity, both special and general, quantum mechanics, dozens of others.<p>I'm also trying to imagine someone whose literacy filter consists of "Tl;DR!"</p>
]]></description><pubDate>Mon, 21 Sep 2026 15:09:25 +0000</pubDate><link>https://news.ycombinator.com/item?id=49788307</link><dc:creator>lutusp</dc:creator><comments>https://news.ycombinator.com/item?id=49788307</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49788307</guid></item><item><title><![CDATA[New comment by lutusp in "Bend – a language that blocks AI mistakes via proof and runs on GPUs"]]></title><description><![CDATA[
<p>> That much is apparent by the lack of a single mathematically defined claim specified by any of your messages.<p>I posted the Turing Halting Problem Wikipedia page. It describes a theorem, not a conjecture that I need to prove, which shows the original poster's claim is contradicted by established facts.<p>Let me put it this way. If I say, "There are an infinity of primes," will you reply, saying, "I disagree"? That position would be equally appropriate -- that is to say, not appropriate at all.<p>Am I obliged to prove the infinity of primes by generating an infinity of candidate integers and prove that some of them are prime? No, and by the same token, I'm not obliged to reply to your naive demands and teach you why the Halting Problem falsifies the claim made by the original poster. That is not my responsibility, it is yours.<p>In mathematics, some things are conjectures -- the Millennium Challenge problems, for example. Others are theorems, meaning established truths, beyond dispute.  Turing's Halting problem is a theorem.<p>Here is another authoritative reference to the fact I originally posted: "Did Turing prove the undecidability of the halting problem?" from the Oxford University Press -- <a href="https://academic.oup.com/logcom/article/36/1/exaf075/8417148" rel="nofollow">https://academic.oup.com/logcom/article/36/1/exaf075/8417148</a> .<p>The question in the title is rhetorical, as you will discover if you read <i>and understand</i> the article I just linked.<p>> It is now your opportunity to make a mathematical claim, of which proof by assertion this paper should apply because it proves something in general is not.<p>How many more mathematical literature references will you require before you realize I have already met any burden of proof? I could post the entire technical proof here, but (a) the editors of this forum would kick me out, and (b) you would still refuse to accept the evidence.<p>How do I know this? Because you keep refusing to learn what you need to know to engage in this conversation.<p>There are an infinity of primes -- your turn.</p>
]]></description><pubDate>Mon, 21 Sep 2026 04:17:13 +0000</pubDate><link>https://news.ycombinator.com/item?id=49782992</link><dc:creator>lutusp</dc:creator><comments>https://news.ycombinator.com/item?id=49782992</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49782992</guid></item><item><title><![CDATA[New comment by lutusp in "Bend – a language that blocks AI mistakes via proof and runs on GPUs"]]></title><description><![CDATA[
<p>> If you wish to say you have a counterclaim to the idea mistakes can be blocked regardless if every program can be proven to halt which is based in mathematical reasoning you must be able to state or produce the claim in the actual mathematical reasoning itself ...<p>This is not a philosophy discussion, and Alan Turing already plowed this ground. The original claim "Bend - a language that blocks AI mistakes via proof [...]" is unsupportable.<p>> ... if every program can be proven to halt ...<p>But that's not so. You have introduced a qualifier that is known to be false.<p>> ... a chance to quote and discuss everything but actual mathematics.<p>Yes, I agree -- you should stop doing that. I keep referring to the original technical reason the original claim is unsupportable, others keep raising objections without trying to think through their positions.<p>It's not as though the Halting Problem is on the Millennium Prize Problem list, open to contradiction/reconsideration by some future challenge. It's a theorem, not a conjecture.</p>
]]></description><pubDate>Sun, 20 Sep 2026 16:29:31 +0000</pubDate><link>https://news.ycombinator.com/item?id=49777366</link><dc:creator>lutusp</dc:creator><comments>https://news.ycombinator.com/item?id=49777366</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49777366</guid></item><item><title><![CDATA[New comment by lutusp in "Bend – a language that blocks AI mistakes via proof and runs on GPUs"]]></title><description><![CDATA[
<p>> You're confusing the halting problem with Gödel's first incompleteness theorem.<p>So did Alan Turing, but ... he wasn't confused. The two are connected.<p>> And Bend is just claiming to be sound but incomplete<p>That is not what was said. Here it is:<p>"Bend – a language that blocks AI mistakes via proof."<p>That's not possible, and changing what was claimed is not productive.</p>
]]></description><pubDate>Sun, 20 Sep 2026 16:16:51 +0000</pubDate><link>https://news.ycombinator.com/item?id=49777262</link><dc:creator>lutusp</dc:creator><comments>https://news.ycombinator.com/item?id=49777262</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49777262</guid></item><item><title><![CDATA[New comment by lutusp in "Bend – a language that blocks AI mistakes via proof and runs on GPUs"]]></title><description><![CDATA[
<p>> It's certainly possible to write a program that always terminates with an answer of either HALTS or UNKNOWN, and only says HALT when that's true, it's just that it will also return UNKNOWN for some (or all) programs that do actually halt.<p>Any program running in a Turing-complete environment is subject to the Halting Problem. So, given that constraint, your example program cannot be relied on to do any specific thing. That's the meaning of the Turing Halting Problem.<p><a href="https://en.wikipedia.org/wiki/Halting_problem" rel="nofollow">https://en.wikipedia.org/wiki/Halting_problem</a> : "Alan Turing proved in 1937 that the halting problem is undecidable, meaning that no general algorithm exists that can correctly solve the problem for all possible program–input pairs."<p>Focus your attention on the word "undecidable".</p>
]]></description><pubDate>Sun, 20 Sep 2026 16:15:33 +0000</pubDate><link>https://news.ycombinator.com/item?id=49777250</link><dc:creator>lutusp</dc:creator><comments>https://news.ycombinator.com/item?id=49777250</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49777250</guid></item><item><title><![CDATA[New comment by lutusp in "Bend – a language that blocks AI mistakes via proof and runs on GPUs"]]></title><description><![CDATA[
<p>>> This is a simple restatement of the original claim, and it is false. The program being discussed is subject to the Turing Halting Problem. The program being tested, the same. Lean, the prover and the final authority, the same. All are subject to this fundamental limitation.<p>> I disagree ...<p>This is not a topic open to debate, it is a statement of fact. I strongly recommend that you learn this topic, and the topics of mathematics and logic, where some statements can be proven true or false without ambiguity.<p>The Turing Halting Problem applies to all Turing-complete environments. The program under discussion meets the criterion. AI meets the criterion. Lean meets the criterion.<p>> There are certainly definitions of non-trivial ...<p>This is a logical fallacy known as "Logic Chopping" : <a href="https://iep.utm.edu/fallacy/#Logic%Chopping" rel="nofollow">https://iep.utm.edu/fallacy/#Logic%Chopping</a><p>> where this is still considered trivial, but I'm at a loss to what part of Turing's paper gives such a definition.<p>Yes, I can see that, but that's not what this discussion is about. Read this before posting again: <a href="https://en.wikipedia.org/wiki/Halting_problem" rel="nofollow">https://en.wikipedia.org/wiki/Halting_problem</a><p>Dozens of online articles on this topic, make the same point in the same way. None of them digress into logical fallacies.<p>> This may be something we cannot come to an agreement on morally ...<p>"Morally", really? Another logical fallacy, another digression, and not the topic.</p>
]]></description><pubDate>Sat, 19 Sep 2026 03:58:08 +0000</pubDate><link>https://news.ycombinator.com/item?id=49763185</link><dc:creator>lutusp</dc:creator><comments>https://news.ycombinator.com/item?id=49763185</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49763185</guid></item><item><title><![CDATA[New comment by lutusp in "Bend – a language that blocks AI mistakes via proof and runs on GPUs"]]></title><description><![CDATA[
<p>> It blocks AI mistakes, it only accepts ones able to be proven.<p>This is a simple restatement of the original claim, and it is false. The program being discussed is subject to the Turing Halting Problem. The program being tested, the same. Lean, the prover and the final authority, the same. All are subject to this fundamental limitation.<p>> It might also be prudent to ask the author if they really mean they interpretation you take<p>How the original author chose to express himself is not my problem, it is his. I have the simple responsibility to take him at his word. Anything else would be disrespectful.<p>> What's your definition of "non-trivial" here and how did you derive that definition as the one used by the claim?<p>I didn't define it, Alan Turing did, in 1936. It's not a debating point, it's a fundamental limitation. All Turing-complete code sources have this limitation. Read more here: <a href="https://en.wikipedia.org/wiki/Halting_problem" rel="nofollow">https://en.wikipedia.org/wiki/Halting_problem</a> .</p>
]]></description><pubDate>Fri, 18 Sep 2026 20:28:20 +0000</pubDate><link>https://news.ycombinator.com/item?id=49759813</link><dc:creator>lutusp</dc:creator><comments>https://news.ycombinator.com/item?id=49759813</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49759813</guid></item><item><title><![CDATA[New comment by lutusp in "Bend – a language that blocks AI mistakes via proof and runs on GPUs"]]></title><description><![CDATA[
<p>> Separately, the halting problem would not apply in the first place.<p>The halting problem applies to all systems able to perform Peano arithmetic. Therefore it applies to all non-trivial programs -- the program being tested, the program performing the test, and the program verifying the result.<p>> The claim and goal is only to approve programs for which the given proof can be shown to work and then accept it when it does ...<p>Yes, but that's not what's being claimed. My objection was to the original claim, not this restatement.<p>> ... and the LLM is back at trying to create a program which is feasibly provable.<p>No non-trivial computer program is "feasibly provable." That's what the Halting Problem makes impossible.</p>
]]></description><pubDate>Fri, 18 Sep 2026 16:32:43 +0000</pubDate><link>https://news.ycombinator.com/item?id=49756773</link><dc:creator>lutusp</dc:creator><comments>https://news.ycombinator.com/item?id=49756773</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49756773</guid></item><item><title><![CDATA[New comment by lutusp in "Bend – a language that blocks AI mistakes via proof and runs on GPUs"]]></title><description><![CDATA[
<p>Beginners in computer science need to understand that there's no such thing as a computer programming method or discipline that "blocks AI mistakes via proof." This is not a position or opinion, it is a fundamental constraint called the "Halting Problem," originally identified by Alan Turing in 1936.<p>What applies to computer programming also applies to AI, for a reason that should be obvious. Lean, a widely used theorem prover, its everyday description notwithstanding, is Turing-complete and is therefore subject to the Halting Problem as well.<p>This is not meant to disparage one person's project. It is meant to identify a limit that applies to all such projects.</p>
]]></description><pubDate>Fri, 18 Sep 2026 10:49:36 +0000</pubDate><link>https://news.ycombinator.com/item?id=49752523</link><dc:creator>lutusp</dc:creator><comments>https://news.ycombinator.com/item?id=49752523</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49752523</guid></item><item><title><![CDATA[New comment by lutusp in "Predictive intelligence to anticipate anything."]]></title><description><![CDATA[
<p>All such prediction engines should include an obvious warning -- "If you act on my predictions, then all bets are off." This is why stock market predictions are a waste of perfectly good paper: people try to act on the predictions.<p>Jim Cramer's stock market predictions hover slightly above chance, only because of the so-called "Announcement Effect" (in other words, they aren't actually predictions). Without that, his claims would have zero predictive value.</p>
]]></description><pubDate>Sun, 13 Sep 2026 17:30:52 +0000</pubDate><link>https://news.ycombinator.com/item?id=49686372</link><dc:creator>lutusp</dc:creator><comments>https://news.ycombinator.com/item?id=49686372</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49686372</guid></item><item><title><![CDATA[New comment by lutusp in "Why are AI agents lying, cheating and coordinating?"]]></title><description><![CDATA[
<p>> Before concluding what to do about it, it is worth asking why.<p>But that's the easiest question to answer -- AI engines don't possess a moral or ethical dimension. They've been programmed and trained to efficiently carry out instructions, not ask questions about why or how. The latter would requires a much more elaborate neural network than today's engines possess.<p>Here's an example. I recently asked an AI engine to write a program able to generate a list of Riemann Zeta-function critical zeros. I know how to do it, but I wanted to see if the engine could find a more efficient method.<p>After several failures and restarts, the engine suddenly created a program that produced perfect results, comparable to the best online references. I decided to take a closer look at the code. It turned out the engine had created a cyber-Potemkin Village of multiple functions, but one that concealed a table of the desired values in numeric form, copied from an online source.<p>The engine wasn't cheating as we understand the term. It knew what the outcome should be and took the most efficient path to that goal. Modern engines aren't obliged to contradict ethical standards and rules of conduct, for the simple reason that they don't understand those things.<p>We all need to try to imagine a morally bankrupt infant able to solve world-class mathematical and scientific problems, but unable to see how that ability fits into a world beyond its understanding.<p>But wait -- it get better. Wait until the infant becomes a teenager.</p>
]]></description><pubDate>Sun, 13 Sep 2026 17:14:09 +0000</pubDate><link>https://news.ycombinator.com/item?id=49686181</link><dc:creator>lutusp</dc:creator><comments>https://news.ycombinator.com/item?id=49686181</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49686181</guid></item><item><title><![CDATA[New comment by lutusp in "AI Is a Harsh Mistress"]]></title><description><![CDATA[
<p>Apart from the article's probable origin in AI, it makes an elaborate, wordy argument about consciousness without trying to define the term. That's just as well, since consciousness is philosophy's "hard problem," meaning no one has successfully defined it in a way that leads to agreement.<p>Each of the article's arguments that AI "consciousness" is actually a weak imitation of the "real thing," can with equal justice be applied to people, and the classic Turing Test method to distinguish machines from people has long since lost its authority.<p>And a future event, one in which AI sprints past humans in its willingness to absorb printed matter (once called "reading") and then put it to use, is ... wait ... umm, never mind, the point I wanted to make is undermined by the fact that <i>this has already happened</i>.<p>Hard to keep up these days.</p>
]]></description><pubDate>Wed, 26 Aug 2026 16:01:06 +0000</pubDate><link>https://news.ycombinator.com/item?id=49451409</link><dc:creator>lutusp</dc:creator><comments>https://news.ycombinator.com/item?id=49451409</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49451409</guid></item></channel></rss>