srcreigh

16 ms·

271.
by srcreigh 3y ago
The author is referring to something called Chaitin incompleteness. https://en.wikipedia.org/wiki/Kolmogorov_complexity#Chaitin'... Of course trivially some KC can be proven, ex a language with 1 or 0 characters t
272.
by srcreigh 3y ago
Agreed. Western musicians have a sort of indoctrination/familiarity towards ET, leaving the untrained folks better equipped to recognize Just intoned harmony. Also agreed re: pleasant intervals. My favourite example (which I have poste
273.
by srcreigh 3y ago
It cannot be overstated that the actual study data without exception points to the opposite conclusion, that pythagorean intervals (mathematical ratios) are in fact what we prefer. Study link: https://www.nature.com/articles
274.
by srcreigh 3y ago
In racket: (for/list ([i (in-range 10) #:when (zero? (remainder i 3))]) (pow i 2)) there’s also for/vector for/and for/or for/first for/last, most likely for/set. Hashes. can
275.
by srcreigh 3y ago
duplicate port number can be checked in the type system if you’re using racket, at least
276.
by srcreigh 3y ago
90 second video demonstration: https://www.youtube.com/watch?v=VnC8I3d2MXQ Lots of different notes present. Perfect 5th, major 2nd, major 3rd, major 7th are all found in the harmonic series. In addition there's some be
277.
by srcreigh 3y ago
Everything is working fine for me, same as the last few years. I mostly listen to weird electronic music in my car with an iPhone.
278.
by srcreigh 3y ago
Keeping in mind what a browser could have been in 2024 if Apple hadn't disallowed/slowed innovation, it's fair to say browsers aren't allowed on the App Store.
279.
by srcreigh 3y ago
> In 2021, Yaden and Griffiths proposed an experiment, the only definitive study that could disprove the importance of subjective effects: the administration of psychedelics to individuals rendered fully unconscious via deep anesthesia,
280.
by srcreigh 3y ago
(let/cc ret (when (= y 0) (ret nil) (/ x y))
281.
by srcreigh 3y ago
We need to cross analysis people across the axes of tall/short and large/small head for posterity
282.
by srcreigh 3y ago
Honestly, a stream of thoughts 1.5hr video about it all would be a cool listen. Not that it has to be 1.5hr but I’m sure your unedited thoughts will have some great insights
283.
by srcreigh 3y ago
It will never happen. Some open math problems are equivalent to the halting problem; and we know that finite computers can’t solve the halting problem.
284.
by srcreigh 3y ago
Have you considered a pihole with a blocklist config which covers social media domains?
285.
by srcreigh 3y ago
connecting to remote DB and impersonating a user account for bug hunting is too easy right now, let’s create the need for a way to proxy to local client computers with greater access to their private information.
286.
by srcreigh 3y ago
You must not believe in human free will then. Or maybe you don’t believe the brain is the key aspect of human intelligence. Or believe the brain is more than just a organic NN
287.
by srcreigh 3y ago
is your sub growing?
288.
by srcreigh 3y ago
Also, for a nice deepening of the situation.. in the 70's John Conway proved that generalized Collatz problems are undecidable. AKA, you can compile turing machines to Collatz problems This means all the characteristics of busy beaver
289.
by srcreigh 3y ago
> But let's note that "undecidable" has a specific meaning here, that batches of logic axioms can't prove their own consistency It's not actually that specific. There are many statements that we know are unprovab
290.
by srcreigh 3y ago
What is "fractional N-ation"?
291.
by srcreigh 3y ago
> The vast majority of the microbes that were detected do not cause disease in healthy people, with the exception of Staphylococcus aureus. Some of the bathroom bacteria, such as Acinetobacter, only cause infections in people in the hosp
292.
by srcreigh 3y ago
I believe we are in agreement about everything. I just would not say that undecidability is the reason why we can't solve BB(6), it would be some reason such as you mention (unable to prove 6-state machines halt). In jest. If I am lack
293.
by srcreigh 3y ago
ADHD has treatments which help significantly (structured lifestyle, medication). It’s like asking how half blind people can drive (answer is: they wear glasses to help them see)
294.
by srcreigh 3y ago
Thanks, fun discussion. I think we understand each other. I’m not so worried about consistency. Even ZFC has the issue you describe. I found this paragraph from Wikipedia about Gödels 2nd incompleteness theorem very interesting. > The co
295.
by srcreigh 3y ago
Such as?
296.
by srcreigh 3y ago
there's been reduction to 745 in more recent work https://scottaaronson.blog/?p=7388
297.
by srcreigh 3y ago
There’s no known reason why we can’t compute any specific busy beaver number. We just can’t write code to list them indefinitely. No known reason why we can’t solve the first 100k, for example. Whereas the halting problem is known to be uns
298.
by srcreigh 3y ago
> Each individual busy beaver number can't be solved in theory for the same reason that the halting problem can't - if you try to check all n-state Turing machines to compute BB(n) some of them won't halt, and some of thos
299.
by srcreigh 3y ago
Yeah. In the most egregious case it could come down to simply listing the numbers that we have proofs for. Another interesting thought is whether we can prove the limit of say ZFC in busy beaver numbers with just ZFC. We have BB(745) limit
300.
by srcreigh 3y ago
Busy beaver series is uncomputable as a whole, but not for its individual values. So in theory we can solve arbitrarily many busy beaver numbers, just can’t write a program to list them endlessly. Ex: no reason yet in theory why we can’t so

More ›