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

No one knows if the pigeon-hole principle applies absolutely exclusive to the ability to generalize outside of a training set.

That is the existential, $1T question.


This is day 1 jailbreaking common sense


False, facts only need to be seen once, and one mis-step in reasoning and your CoT is derailed.


> one mis-step in reasoning and your CoT is derailed.

tell me you've never seen reasoning traces without telling me


  > the open-domain Frame Problem is equivalent to the Halting Problem and is therefore undecidable.
Thank you, Code as Data problems are innate to the von Nuemman architecture, but I could never articulate how LLMs are so huge they are essentially Turing-complete and equivalent computationally.

You _can_ combinate through them, just not in our universe.


this is very wrong. LLMs are very much not Turing complete, but they are algorithms on a computer so they definitely can't compute anything uncomputable


"Essentially"

This is the #1 pedantic thing HN frequenters flail over.

Turing built a limited machine, bound to a finite tape.

Bravo.


Turing machines are typically described as having an infinite tape. It may not be able to access that tape in finite time, but the tape is not bound to a finite tape

But it doesn't matter, it is an abstract model of computation.

But it doesn't matter Church–Turing thesis states that a function on the natural numbers can be calculated by an effective method if and only if it is computable by a Turing machine.

It doesn't matter if you put the algorithm on paper, on 1 or k tapes etc...

Rice's theorem I mentioned above is like Scott–Curry theorem in Lambda calculus. Lambda calculus is Turing complete, that is, it is a universal model of computation that can be used to simulate any Turing machine.

The similar problems with 'trivial properties' in TMs end up being recursively inseparable sets in Lambda calculus.


Maybe those software engineers should "lrn2code", just as the journalists, artists, and trucker drivers had to.


The hospital was full.

The institute would never be full.

There is no "bring your child to work day" in China.

Weird conflation, unlikely... uunless you mean to muddy the waters and sow dis-information.


I would argue you are sowing disinfo and I honestly dont know what point you are trying to make. Spikes and/or significant reductions in activity as indicated by external data sources, and particular the timing thereof, will obviously be very useful for determining the sequence of events.


The hospital, sure.

Why would Wuhan center being empty represent anything?

People don't rush to a random (unrelated) building when they get sick at the "market".

Coincidence, surely?

What are the chances of having a specialized infectious disease center next to where that type of disease spontaneously emerged?

More or less likely than a bat having sex with a panda possum?

No one, not even the cowardly academics, believed it.


Lol people were getting called racist for suggesting it was anything less than the spawn of a bat and an asian water racoon.

It still isn't even acceptable to acknowledge the (blatant) possibility that Omnicron was intentionally leaked because of low vaccine effectiveness.


Let's be honest, if their is a global conspiracy to spread disease I think it's to kill off the masses due to AI replacing jobs and lowering the amount of green houses gasses people produce.


I'm guessing by not jumping into a terminating/ halting NOOP.

The logic is within the branching.


Sieve the temporary backprop interim weights as a function of its loss of varentrophy relative to its place in the revalued weights.

Remove the bottom weights dynamically based on the local gradient in varentrophy so that internal dissonance ("doubt") can be selected against.

"Preference Optimization" but with more opportunities for meta-optimization.


"Workflow automation" is gonna be the goalpost to beat


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

Search: