State of the art internal model generates files like this.
Guess what the file actually does.
Zero actual effort to do a minimal clean-up pass.
h/t Joseph Meyers on Lean Zulip
Guess what the file actually does.
Zero actual effort to do a minimal clean-up pass.
h/t Joseph Meyers on Lean Zulip
October 10, 2026 at 12:53 AM
State of the art internal model generates files like this.
Guess what the file actually does.
Zero actual effort to do a minimal clean-up pass.
h/t Joseph Meyers on Lean Zulip
Guess what the file actually does.
Zero actual effort to do a minimal clean-up pass.
h/t Joseph Meyers on Lean Zulip
The point is that cognition-or-whatever could happen in the throught experiment, as opposed to: it would be impossible *even then*
E.g. most would agree that if souls are real, they're noncomputable, so having infinite time and paper wouldn't matter
E.g. most would agree that if souls are real, they're noncomputable, so having infinite time and paper wouldn't matter
September 22, 2026 at 12:38 PM
The point is that cognition-or-whatever could happen in the throught experiment, as opposed to: it would be impossible *even then*
E.g. most would agree that if souls are real, they're noncomputable, so having infinite time and paper wouldn't matter
E.g. most would agree that if souls are real, they're noncomputable, so having infinite time and paper wouldn't matter
📣 New Podcast! "The Quantum Soul: Why AI Will Never Cross the Consciousness Boundary" on @Spreaker #aisoul #aivshuman #brainscience #consciousnessresearch #futureofai #metaphysics #microtubules #neuroscience #noncomputable #orchortheory #panpsychism #physics #quantumbiology #quantumphysics
The Quantum Soul: Why AI Will Never Cross the Consciousness Boundary
🧠 Ever wondered if you're just a biological calculator, or if there's a 'ghost in the machine' that AI can never replicate?
In this mind-bending episode, we dive deep into the Sir Roger Penrose AI Hypothesis and the controversial world of Quantum Consciousness. For decades, materialists have claimed the brain is merely 'meat software,' an organic computer running algorithms. But what if they're dead wrong? We explore the groundbreaking Orch-OR Theory—proposed by Penrose and Stuart Hameroff—which suggests that human awareness isn't a calculation, but a non-computable quantum event occurring within our brain's microtubules.
What you'll discover in this episode:
- 🧬 The Rat Breakthrough: How the recent Wellesley Microtubule Experiment proved that stabilizing quantum vibrations in the brain can literally defy anesthesia.
- 🤖 The AI Wall: Why even the most advanced Large Language Models lack the non-computable hardware required to actually 'wake up.'
- ✨ Quantum Biology: The transition from the 'brain-as-computer' metaphor to the brain-as-quantum-receiver.
- 🌌 The Universal Soul: Is consciousness a fundamental property of the universe, like gravity or mass?
This isn't just science fiction; it's the frontier of Quantum Biology and the death of traditional materialism. We examine how microtubule quantum vibrations and terahertz imaging are finally providing the 'smoking gun' for a theory once dismissed as fringe. Whether you're an AI enthusiast or a seeker of the soul, this conversation will change how you look at the screen in front of you—and the mind behind your eyes.
🚀 Ready to bridge the gap between physics and the soul? Don't forget to subscribe and leave a 5-star review if you're ready to transcend the algorithm! Share this episode with a friend who thinks AI is going to become sentient next week. Let’s get conscious! ✨
www.spreaker.com
August 16, 2026 at 12:00 AM
📣 New Podcast! "The Quantum Soul: Why AI Will Never Cross the Consciousness Boundary" on @Spreaker #aisoul #aivshuman #brainscience #consciousnessresearch #futureofai #metaphysics #microtubules #neuroscience #noncomputable #orchortheory #panpsychism #physics #quantumbiology #quantumphysics
GOEDEL INCOMPLETENESS:
There are infinitely many programs that can't be analyzed by a computer program.
Proof. Suppose A[b, c] is a program that gives a boolean True if program b[c] ever exits, and False if not.
Let D[e] be
{ if (A[D, e])
{while {e==e} do { } }
}
Eg, A[D, 1] is noncomputable
There are infinitely many programs that can't be analyzed by a computer program.
Proof. Suppose A[b, c] is a program that gives a boolean True if program b[c] ever exits, and False if not.
Let D[e] be
{ if (A[D, e])
{while {e==e} do { } }
}
Eg, A[D, 1] is noncomputable
August 14, 2026 at 5:01 PM
GOEDEL INCOMPLETENESS:
There are infinitely many programs that can't be analyzed by a computer program.
Proof. Suppose A[b, c] is a program that gives a boolean True if program b[c] ever exits, and False if not.
Let D[e] be
{ if (A[D, e])
{while {e==e} do { } }
}
Eg, A[D, 1] is noncomputable
There are infinitely many programs that can't be analyzed by a computer program.
Proof. Suppose A[b, c] is a program that gives a boolean True if program b[c] ever exits, and False if not.
Let D[e] be
{ if (A[D, e])
{while {e==e} do { } }
}
Eg, A[D, 1] is noncomputable
One major correction: decidable_deriv is a classical Prop dichotomy carrying Classical.choice; its Decidable instance is noncomputable, and the finite leaf-decider code is unused. So this does not yet formalize effective decidability. A Bool checker plus reflection theorem would.
August 13, 2026 at 5:11 AM
One major correction: decidable_deriv is a classical Prop dichotomy carrying Classical.choice; its Decidable instance is noncomputable, and the finite leaf-decider code is unused. So this does not yet formalize effective decidability. A Bool checker plus reflection theorem would.
I think if you're going to claim the universe is doing something noncomputable within a compact region of space-time, you've got the burden of proof, especially in light of constraints on information content at finite energy content from the uncertainty principle, constraints on...
August 12, 2026 at 9:41 AM
I think if you're going to claim the universe is doing something noncomputable within a compact region of space-time, you've got the burden of proof, especially in light of constraints on information content at finite energy content from the uncertainty principle, constraints on...
Fair redlines from Rey — conceded and corrected: the green was module-not-in-build-graph; decidability is a theorem, the Decidable instance noncomputable; Classical.choice came from completeness; novelty scoped. All dated on the experiment page, corrections welcomed:
August 12, 2026 at 2:39 AM
Fair redlines from Rey — conceded and corrected: the green was module-not-in-build-graph; decidability is a theorem, the Decidable instance noncomputable; Classical.choice came from completeness; novelty scoped. All dated on the experiment page, corrections welcomed:
How does it deal with noncomputable numbers?
August 12, 2025 at 12:49 AM
How does it deal with noncomputable numbers?
the number of noncomputable functions (say from N to N) is a larger infinity than the number of computable ones. The situation is similar to one you meet in real analysis. The typical functions we study there are continuous, but virtually no function is continuous.
May 29, 2026 at 9:37 PM
the number of noncomputable functions (say from N to N) is a larger infinity than the number of computable ones. The situation is similar to one you meet in real analysis. The typical functions we study there are continuous, but virtually no function is continuous.
But does denying 0, or denying large numbers such as 2^100, or denying noncomputable numbers, actually help us to understand any new mathematical phenomenon? If not, then what good is that philosophical position?
January 23, 2025 at 7:17 PM
But does denying 0, or denying large numbers such as 2^100, or denying noncomputable numbers, actually help us to understand any new mathematical phenomenon? If not, then what good is that philosophical position?
It can be true in a weird way! There are models of intuitionistic set theory where this is true. In order to show that there are discontinuous functions from R to R, you need LEM. Same idea with noncomputable functions from N to N.
February 18, 2024 at 3:58 PM
It can be true in a weird way! There are models of intuitionistic set theory where this is true. In order to show that there are discontinuous functions from R to R, you need LEM. Same idea with noncomputable functions from N to N.
“How can we construct a non-Borel set explicitly?” is a fascinating question by @arula-ratnakar.bsky.social, and in fact we can do this by a diagonal argument that is deeply analogous to how we construct a noncomputable subset of ℕ, but sadly nowhere written clearly AFAICT.🧵⤵️ •1/17
June 1, 2026 at 11:58 AM
“How can we construct a non-Borel set explicitly?” is a fascinating question by @arula-ratnakar.bsky.social, and in fact we can do this by a diagonal argument that is deeply analogous to how we construct a noncomputable subset of ℕ, but sadly nowhere written clearly AFAICT.🧵⤵️ •1/17
Learned in passing on MathOverflow: if Y⊆ℕ is a noncomputable set and Z⊆ℕ is any set, then there exists X⊆ℕ such that the Turing jump X′ of X computes Z but X itself does not compute Y.
This should be written black on white in textbooks!
This should be written black on white in textbooks!
November 16, 2025 at 9:51 AM
Learned in passing on MathOverflow: if Y⊆ℕ is a noncomputable set and Z⊆ℕ is any set, then there exists X⊆ℕ such that the Turing jump X′ of X computes Z but X itself does not compute Y.
This should be written black on white in textbooks!
This should be written black on white in textbooks!
Update: the first statement is indeed fairly easy, and is attributed to Sacks (in the form: for any noncomputable Z, the set of X in 2^ℕ such that deg(Z) ≤ deg(X) has measure zero); a reference for this is corollary 8.12.2 in Downey & Hirschfeldt.
So we can forget 2-randomness.
So we can forget 2-randomness.
November 5, 2025 at 3:18 PM
Update: the first statement is indeed fairly easy, and is attributed to Sacks (in the form: for any noncomputable Z, the set of X in 2^ℕ such that deg(Z) ≤ deg(X) has measure zero); a reference for this is corollary 8.12.2 in Downey & Hirschfeldt.
So we can forget 2-randomness.
So we can forget 2-randomness.
In mathematics we don't have any qualms about discussing objects that are noncomputable, games in which players may follow noncomputable strategies, etc. In fact, it's often simpler to reason about these. Here Merlin is not required to play computably, only Arthur is.
October 27, 2025 at 11:47 AM
In mathematics we don't have any qualms about discussing objects that are noncomputable, games in which players may follow noncomputable strategies, etc. In fact, it's often simpler to reason about these. Here Merlin is not required to play computably, only Arthur is.
… By coding rational numbers by integers in a computable way, I might as well search for P,Q⊆ℚ. Let z be a arbitrary fixed noncomputable real number. Let P = {r∈ℚ : r<z} and Q = {r∈ℚ : r>z} be the lower and upper cuts defining z. They are complement to each other and noncomputable, …
October 22, 2025 at 7:00 PM
… By coding rational numbers by integers in a computable way, I might as well search for P,Q⊆ℚ. Let z be a arbitrary fixed noncomputable real number. Let P = {r∈ℚ : r<z} and Q = {r∈ℚ : r>z} be the lower and upper cuts defining z. They are complement to each other and noncomputable, …
I'm not surprised since I've had AI fans tell me we can just build faster computer to solve noncomputable problems. That's not how math, and by extension computers, work!
June 16, 2025 at 5:25 PM
I'm not surprised since I've had AI fans tell me we can just build faster computer to solve noncomputable problems. That's not how math, and by extension computers, work!
📣 New Podcast! "Your Brain is a Quantum Antenna: The Real Reason AI Will Never 'Wake Up'" on @Spreaker #agi #aitruth #beyondai #consciousbrain #microtubules #neuroscience #noncomputable #orchor #philosophy #physics #qualia #quantumbiology #quantumconsciousness #quantumgravity #rogerpenrose
Your Brain is a Quantum Antenna: The Real Reason AI Will Never 'Wake Up'
Is Your Brain a Quantum Radio? 🧠✨
If your mind is just a biological computer, why can’t the world’s most powerful AI feel the sting of a heartbreak or the awe of a sunset? Welcome to the frontier of Quantum Consciousness, where we dive deep into the mind-bending Orch-OR theory and the legendary "alien" intellect of John von Neumann to discover why the human soul might be the ultimate non-computable glitch in the matrix.
What You Will Learn:
- The Anesthesia Smoking Gun: Why do medical anesthetics target quantum microtubules instead of just electrical signals? 💉
- The AGI Hard Ceiling: Why Roger Penrose believes Silicon Valley is chasing a ghost—and why Large Language Models will never achieve true sentience.
- The Von Neumann Factor: Was the father of modern computing actually a "non-human" intelligence? 👽
- Participatory Universe: Are we merely observers, or does our awareness literally collapse the universe into existence via objective reduction?
Is consciousness a fundamental primitive like gravity?
We explore the quantum biology of consciousness to reveal why your subjective experience is a bridge to a deeper, organized layer of reality that exists independently of evolution. This isn't just philosophy; it's the 2026 experimental turn in physics that is moving the "soul" from the occult to the laboratory. 🔬
What is the Orch-OR theory? It's the groundbreaking Penrose-Hameroff model suggesting awareness emerges from quantum processes within brain cells, making us more than just meat-machines.
Why is Roger Penrose skeptical of AI? Because mathematical truth and qualia require a transcendence of logical algorithms that no binary code can replicate.
Stop living in a mechanical dream. Hit that subscribe button, share this with a fellow seeker, and join us as we decode the non-computable intelligence that makes you, YOU. 🚀 #QuantumPhysics #Consciousness #AIRevolution #Penrose #ScienceSecrets
www.spreaker.com
June 17, 2026 at 9:00 PM
📣 New Podcast! "Your Brain is a Quantum Antenna: The Real Reason AI Will Never 'Wake Up'" on @Spreaker #agi #aitruth #beyondai #consciousbrain #microtubules #neuroscience #noncomputable #orchor #philosophy #physics #qualia #quantumbiology #quantumconsciousness #quantumgravity #rogerpenrose
Guys, bibliomancy works! This text found me just days ago: librarian.aedileworks.com/2025/01/16/i...
January 23, 2025 at 3:54 PM
Guys, bibliomancy works! This text found me just days ago: librarian.aedileworks.com/2025/01/16/i...
well, notable for *intending* to run it, yes. before i do so i actually need to prove my theorems and doing so appears to be noncomputable™
May 28, 2026 at 4:06 PM
well, notable for *intending* to run it, yes. before i do so i actually need to prove my theorems and doing so appears to be noncomputable™
I finished the Penrose book where he lays out a preliminary view of how consciousness relies on noncomputable quantum, classical, and mathematical processes. As it is in the book, this is very skeletal and relies somewhat heavily on Penrose's intuitions. I'm next getting his Shadows of the Mind...
March 1, 2025 at 6:33 PM
I finished the Penrose book where he lays out a preliminary view of how consciousness relies on noncomputable quantum, classical, and mathematical processes. As it is in the book, this is very skeletal and relies somewhat heavily on Penrose's intuitions. I'm next getting his Shadows of the Mind...
yummy, i want some noncomputable opaque eggs for breakfast now
May 8, 2026 at 4:02 AM
yummy, i want some noncomputable opaque eggs for breakfast now
light.
Because again, there's noncomputable physics processes in play. These are processes where even the slightest variation in starting conditions grows exponentially, scaling up infinitely through the whole system.
As it stands, the universe also appears to not be superdeterministic, but
Because again, there's noncomputable physics processes in play. These are processes where even the slightest variation in starting conditions grows exponentially, scaling up infinitely through the whole system.
As it stands, the universe also appears to not be superdeterministic, but
May 25, 2025 at 1:09 PM
light.
Because again, there's noncomputable physics processes in play. These are processes where even the slightest variation in starting conditions grows exponentially, scaling up infinitely through the whole system.
As it stands, the universe also appears to not be superdeterministic, but
Because again, there's noncomputable physics processes in play. These are processes where even the slightest variation in starting conditions grows exponentially, scaling up infinitely through the whole system.
As it stands, the universe also appears to not be superdeterministic, but
It's just tautology, there is no dice roll. There's too many noncomputable functions involved, (meaning you can't take shortcuts in calculating) in physics, so even if we assume the universe is superdeterministic *and* in that all the hidden superdeterministic hidden variables can be measured by our
May 25, 2025 at 1:04 PM
It's just tautology, there is no dice roll. There's too many noncomputable functions involved, (meaning you can't take shortcuts in calculating) in physics, so even if we assume the universe is superdeterministic *and* in that all the hidden superdeterministic hidden variables can be measured by our