Hacker Newsnew | past | comments | ask | show | jobs | submit | voidmain's commentslogin

The most likely path I see for human survival and flourishing is for AI to do something in the near future so destructive and terrifying that it unites humanity behind permanently banning it at any cost.

It therefore seems like "AI safety" people may actually be working against our safety.


Sort of like how the human economy is limited by the fact that ants can't afford our products and services?


The first thing I do when I see an interesting article title is click on the comments to see if people have noticed that it's AI generated. If I didn't have this option because of the policy you desire, I would probably just stop reading HN entirely.


I'll defend i^4x since I like it better.

(cost x, sint x) is a point on the unit circle x turns counterclockwise from (1,0).

cost x + i sint x is a point in the complex plane x turns counterclockwise from 1.

Now look at integer powers of i, a point in the complex plane 1/4 turn from 1:

i^0 = 1 (0 turns from 1)

i^1 = i (1/4 turn from 1)

i^2 = -1 (2/4 turn from 1)

i^3 = -i (3/4 turn from 1)

and we define complex exponentiation such that, for all real x,

i^x = cost (x/4) + i sint (x/4) (x/4 turn from 1)


How about i^4x? It makes it clearer which direction we are rotating (vs -1 which is a 0.5 turn rotation in either direction) and avoids the garden path confusion that could arise from it not being obvious from the left side of the equation that we are working in the complex plane at all.


> AI writes copy like this because that's how copywriters did it in the training set

I don't think this is true. Someone probably had to write like this, but a base model has to be able to write like anyone. The specific mannerisms of AI appear in post training, either as things that are rewarded or as mode collapse artifacts. ChatGPT didn't get obsessed with goblins because that's incredibly common among humans.


The visualization is of the power set, which is uncountable.


Right. But because it’s the smallest structure of its type (speaking loosely) it feels like something we should have a grasp on, even though it contains more complexity than we could ever describe or compute with (since both of those are countable.)


> Q: Do you think KVM vulnerabilities will keep appearing?

> A: Yes. I recommend establishing a sustainable patching process for host hypervisors. Winter is coming.


Vibe coding is doing its part to keep linguistic diversity alive: My wife went to sign up for a doctors appointment, and the form offered choices for "preferred language" that included Old English, ancient Egyptian and Elamite.


I think you have slightly misunderstood the halting problem. There is no computer program H that, for every program P, determines whether P halts. This does not imply that for some particular program Q there is no proof that it halts. In fact in the setting where programs do not take input there is always such a proof (just a trace of the program running to completion). And there are many valid proofs of theorems like "For all x, Q(x) halts" for particular Q. Consider, for example, the case where Q has no control flow at all!


I think it's more that I lean into some of the corollaries that directly factor computation time into account. There is no computer program H that for every program P determines whether P halts faster than running P.

You cannot find/prevent every case of an infinite loop at design time/compile time if the only way to determine a complex enough control flow converges towards halting is to run the full program in a live environment.


Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: