HNHacker News
TopNewBestAskShowJobs

qnleigh

2,052 karma · joined March 12, 2023

submissionscomments
qnleigh··on The Onion to Take over InfoWars
When this all started, the Onion released a priceless 'press statement':

"Through it all, InfoWars has shown an unswerving commitment to manufacturing anger and radicalizing the most vulnerable members of society—values that resonate deeply with all of us at Global Tetrahedron.

No price would be too high for such a cornucopia of malleable assets and minds. And yet, in a stroke of good fortune, a formidable special interest group has outwitted the hapless owner of InfoWars (a forgettable man with an already-forgotten name) and forced him to sell it at a steep bargain: less than one trillion dollars..."

Full statement here https://theonion.com/heres-why-i-decided-to-buy-infowars/

qnleigh··on ChatGPT Images 2.0
No this is what life looks like on the other side of the uncanny valley. The images don't look creepy because they look artificial or wrong. They're a reminder of a creepy new reality where our eyes can no longer tell us what's real.
qnleigh··on Quantum Computers Are Not a Threat to 128-Bit Symmetric Keys
The quantum circuit to factor 15 is a weird special case that can be factored with just a handful of logic gates [0]. Factoring 21 will require quantum error correction, which adds a huge amount of overhead.

[0] https://algassert.com/post/2500

qnleigh··on Any Color You Like: NIST Scientists Create 'Any Wavelength' Lasers
Combining red, green and blue tricks our eyes into perceiving any color that we can perceive, but it's a very different thing to make a laser that can output any wavelength, like they do here.
qnleigh··on The buns in McDonald's Japan's burger photos are all slightly askew
I would love to believe that a regulator got served a crooked McDonald's burger, looked at the pristine menu photos, and said 'nope.'

I'm half joking but this feels plausible.

qnleigh··on Who is Satoshi Nakamoto? My quest to unmask Bitcoin's creator
We also have this gem:

> And Mr. Back’s thesis project focused on C++ — the same programming language Satoshi used to code the first version of the Bitcoin software.

Amazing! I bet they both for loops too! I heard Bitcoin relies heavily on for loops.

Infuriatingly, to people who don't know much about programming, these pieces of 'evidence' might sound quite compelling, because it will all sound equally obscure to them.

I'm only a quarter of the way through this piece, but I'm finding it very hard to take seriously.

qnleigh··on Project Glasswing: Securing critical software for the AI era
This is buried in section 7.6 of a 244 page document. Amodei probably hasn't even read it.
qnleigh··on Project Glasswing: Securing critical software for the AI era
I'm confused on this point. The text you quote implies that they were able to build an exploit, but the text quoted in the parent comment implies that they were not.

What were they actually able to do and not do? I got confused by this when reading the article as well.

qnleigh··on Project Glasswing: Securing critical software for the AI era
There is plenty of overhyping, no one denies that. But the antidote is not to dismiss everything. Ignore the words and look at the data.

In this case, I see a pretty strong case that this will significantly change computer security. They provide plenty of evidence that the models can create exploits autonomously, meaning that the cost of finding valuable security breaches will plummet once they're widely available.

qnleigh··on Project Glasswing: Securing critical software for the AI era
Regardless of how impressive you find the vulnerabilities themselves, the fact that the model is able make exploits without human guidance will enable vastly more people to create them. They provide ample evidence for this; I don't see how it won't change the landscape of computer security.
qnleigh··on How many products does Microsoft have named 'Copilot'?
Among many other issues, the experience doesn't come anywhere close to seamless, right? Because each of these things is distinct and can't interface with the others? They could have tried to build a unified assistant, but they prioritized the rush job instead.
qnleigh··on Author of "Careless People" banned from saying anything negative about Meta
Also if you use Instagram regularly, consider replacing that time with something else. Does it really offer anything of value to you, compared to the harm Meta has caused?
qnleigh··on What Gödel Discovered (2020)
Yeah rich is a vague word here. Really we're trying to say 'if a set of axioms can express provability, and can get a sentence to refer to itself, then it can state the liar sentence. And once it can state the liar sentence, then the rest of Gödel's argument follows.' There's no circularity.
qnleigh··on What Gödel Discovered (2020)
> We can't prove that the axioms of arithmetic are consistent

using the axioms themselves. We can prove consistency using a stronger set of axioms, but those axioms have their own liar sentence, and so they can't prove their own consistency. And without knowing if the stronger set of axioms is consistent, we can't be sure that we have really proved the consistency of arithmetic.

qnleigh··on What Gödel Discovered (2020)
You might say "but wait, haven't we just proven that it's true? So isn't that also a contradiction?" This would be a disaster, because it would prove that the axioms of arithmetic are inconsistent! Now 1+1=3 for all we know.

The catch is that when we proved that the sentence is not false, we used proof by contradiction, and for proof by contradiction to be a valid method of proof, we need to assume that the axioms we are working with are consistent (and therefore can't produce a contradiction). So really all we have proved is that either:

- the sentence is true

Or

- the axioms of arithmetic are inconsistent

We can't prove that the axioms of arithmetic are consistent, so we haven't actually proven that the sentence is true. Contradiction avoided.

This issue is actually a major part of Gödel's theorem; we can only avoid a paradox of the axioms of arithmetic can't prove their own consistency. These theorems apply to any system of axioms that are rich enough to state the liar's paradox.

qnleigh··on What Gödel Discovered (2020)
I feel like it's nice to get the gist before diving into the gory details. The proof works by showing that just within the axioms of arithmetic, you can formally state the sentence "this sentence is unprovable." This has some very strange consequences:

- It can't be false, because if it's false then it is provable, and 'provable' means ' can be proven to be true.' That would be a contraction.

- So therefore it must be true, implying that it can't be proven. Consequently there are statements that are true but unprovable, even just within the axioms of arithmetic.

This is Gödel's incompleteness theorem in a nutshell. Most of the proof is spent developing machinery for doing logic, talking about provability, and ultimately getting a statement to refer to itself all using integers and their properties. It's quite satisfying because it doesn't require any super-advanced math, and yet the result is very deep.

qnleigh··on What Gödel Discovered (2020)
Yeah, I think it would be better to first explain the liar's paradox to give the broad brush strokes, and then go into the details of Gôdel numbering.

It seems like most expositions of Gödel's incompleteness theorem go into a surprising amount of detail about Gödel numbering. In a way it's nice though, because you see that the proof is actually pretty elementary and doesn't require fancy math as a prerequisite.

qnleigh··on Quantum computing bombshells that are not April Fools
I don't understand your question. Can you elaborate?
qnleigh··on Quantum computing bombshells that are not April Fools
This comment is wildly inappropriate and violates the community guidelines here. I suggest you delete it.
qnleigh··on Quantum computing bombshells that are not April Fools
This is a good question, and currently the answer is no. Quantum computers can only run very short, simple algorithms right now, because the qubits they're built out of are noisy. You need a lot of error correction, which the community is working on.

The thing is, unlike ordinary computers, quantum computers can factor numbers about as easily as they can multiply them. So as soon as they can multiply two large integers, they'll also be able to factor the result and break RSA encryption based on keys of that size.

This blog post gives a good sense of the state of the art and what progress might look like:

Why haven't quantum computers factored 21 yet? https://algassert.com/post/2500

qnleigh··on The Failure of the Thermodynamics of Computation (2010)
Where? If you mean that a computation was performed without creating any entropy, I'm skeptical. Surely some energy input was needed, and some energy was dissipated.
qnleigh··on The Failure of the Thermodynamics of Computation (2010)
I haven't finished reading this yet, but I don't think the author is saying that the Landauer limit for erasure is wrong. They're saying that there are other limits in computing beyond erasure. I think this makes sense; although reversible computing should be possible at zero temperature and infinite precision, realistic computers need some way to remove entropy that accumulates during the computation.

So I don't think their claim is in tension with any of the papers that you cite.

qnleigh··on Epoch confirms GPT5.4 Pro solved a frontier math open problem
I did mention RL as a valid counterargument in my comment.

I agree that in verifiable domains RL systems should be able to blow past human performance, and this might already be happening. There's another interesting question as to how much RL improves performance on non-verifiable domains. I'm not taking a stance either way, I just think it's an interesting question.

qnleigh··on Further human + AI + proof assistant work on Knuth's "Claude Cycles" problem
In the paper, they give part of their system prompt:

> * After EVERY exploreXX.py run, IMMEDIATELY update this file [plan.md] before doing anything else. * No exceptions. Do not start the next exploration until the previous one is documented here.

Is this known to improve performance for advanced problem solving? If so, why this specific prompt?

qnleigh··on LG's new 1Hz display is the secret behind a new laptop's battery life
> That will help save enormous amounts of power: up to 48 percent on a single charge,

Why does refresh rate have such a large impact on power consumption? I understand that the control electronics are 60x more active at 60 Hz than 1 Hz, but shouldn't the light emission itself be the dominant source of power consumption by far?

qnleigh··on Goodbye to Sora
I've found notebookLM summaries to be too high-level and oversimplified to be useful. Hopefully in a few years they can go deeper.
qnleigh··on Epoch confirms GPT5.4 Pro solved a frontier math open problem
This is why I put 'learned' in quotes. They started from a state of not being able to solve algebra problems or produce basic steps of scientific reasoning to being able to. Operationally, that is what I mean by learning and they unambiguously do it.
qnleigh··on Epoch confirms GPT5.4 Pro solved a frontier math open problem
Actually here's an even better list of progress on a number of open math problems, with plenty of caveats and exposition:

https://github.com/teorth/erdosproblems/wiki/AI-contribution...

qnleigh··on Epoch confirms GPT5.4 Pro solved a frontier math open problem
Where can I read about how LLMs have changed epistemology? Is there a field of philosophy that tries to define and understand 'intelligence'? That sounds very interesting.
qnleigh··on Epoch confirms GPT5.4 Pro solved a frontier math open problem
> I think "novel" is ill defined here

That's exactly my point. When people say "LLMs will never do something novel," they seem to be leaning on some vague, ill-defined notion of novelty. The burden of proof is then to specify what degree of novelty is unattainable and why.

As for evidence that they can do novel things, there is plenty:

1. I really did ask Gemini to multiply 167,383 * 426,397 before posting this question. It answered correctly.

2. SVGs of pelicans riding bicycles

3. People use LLMs to write new apps/code every day

4. LLMs have achieved gold-medal performance on Math Olympiad problems that were not publicly available

5. LLMs have solved open problems in physics and mathematics [0,1]

That is as far as they have advanced so far. What's next? Where is the limit? All I want to say is that I don't know, and neither do you :).

[0] https://www.reddit.com/r/Physics/comments/1n77h10/and_severa... (Mark Raamsdonk is a pretty famous researcher in high-energy physics, not just some random guy)

[1] https://mathstodon.xyz/@tao/115855840223258103

[2] https://news.ycombinator.com/item?id=47497757

← PreviousPage 5 of 17Next →