title of my next paper is tentative, but i'm kinda liking it. yes i'm
quite serious about refuting the church turing thesis. i demonstrate how
an idealized human agent can compute that which is not turing computable.
until someone is willing to grant me an cs.LO endorsement i'm feeling a
bit hesitant to go further into the arguments... idk u could tempt me
prolly Efn+
i'm willing to post the section headers as of now:
1 the halting problem--
2 the circle-free problem
-a2.1 turing's diagonal
-a2.2 a simpler form
3 the self-referential set-classification paradox generalized
-a3.1 clarification on self-reference
4 how undecidability is it?
-a4.1 reducing circle-free to halting
-a4.2 on the "existence" of recursive undecidability
5 rectifying EYou
-a5.1 bugfix: adding an identify check
-a5.2 bugfix: injecting a partial recognizer
-a5.3 a fallacy in turing's proof
6 the anti-diagonal problem
-a6.1 a proposed limit to undecidability within computing
-a6.2 a second fallacy in turing's paper
7 refuting the church turing thesis
-a7.1 the terminal machine
-a7.2 a record on the side
-a7.3 inject value and reduce
-a7.4 objective mechanics vs addressable simulation
title of my next paper is tentative, but i'm kinda liking it. yes i'm
quite serious about refuting the church turing thesis. i demonstrate how
an idealized human agent can compute that which is not turing computable.
title of my next paper is tentative, but i'm kinda liking it. yes i'm
quite serious about refuting the church turing thesis. i demonstrate how
an idealized human agent can compute that which is not turing computable.
until someone is willing to grant me an cs.LO endorsement i'm feeling a
bit hesitant to go further into the arguments... idk u could tempt me
prolly Efn+
i'm willing to post the section headers as of now:
1 the halting problem
2 the circle-free problem
2.1 turing's diagonal
2.2 a simpler form
3 the self-referential set-classification paradox generalized
3.1 clarification on self-reference
4 how undecidability is it?
4.1 reducing circle-free to halting
4.2 on the "existence" of recursive undecidability
5 rectifying EYou
5.1 bugfix: adding an identify check
5.2 bugfix: injecting a partial recognizer
5.3 a fallacy in turing's proof
6 the anti-diagonal problem
6.1 a proposed limit to undecidability within computing
6.2 a second fallacy in turing's paper
7 refuting the church turing thesis
7.1 the terminal machine
7.2 a record on the side
7.3 inject value and reduce
7.4 objective mechanics vs addressable simulation
On 08/26/2026 10:40 PM, dart200 wrote:
title of my next paper is tentative, but i'm kinda liking it. yes i'm
quite serious about refuting the church turing thesis. i demonstrate how
an idealized human agent can compute that which is not turing computable.
until someone is willing to grant me an cs.LO endorsement i'm feeling a
bit hesitant to go further into the arguments... idk u could tempt me
prolly Efn+
i'm willing to post the section headers as of now:
1 the halting problem
2 the circle-free problem
-a 2.1 turing's diagonal
-a 2.2 a simpler form
3 the self-referential set-classification paradox generalized
-a 3.1 clarification on self-reference
4 how undecidability is it?
-a 4.1 reducing circle-free to halting
-a 4.2 on the "existence" of recursive undecidability
5 rectifying EYou
-a 5.1 bugfix: adding an identify check
-a 5.2 bugfix: injecting a partial recognizer
-a 5.3 a fallacy in turing's proof
6 the anti-diagonal problem
-a 6.1 a proposed limit to undecidability within computing
-a 6.2 a second fallacy in turing's paper
7 refuting the church turing thesis
-a 7.1 the terminal machine
-a 7.2 a record on the side
-a 7.3 inject value and reduce
-a 7.4 objective mechanics vs addressable simulation
What you might find is yourself establishing the _independence_
of various ordinary theorems vis-a-vis their conjecture, from
usual ordinary theories that you'll be finding have implicits
and stipulations that while so seemingly innocuous or plain,
were always inside a box that declared itself open and closed.
On 27/08/2026 1:40 PM, dart200 wrote:
title of my next paper is tentative, but i'm kinda liking it. yes i'm
quite serious about refuting the church turing thesis. i demonstrate
how an idealized human agent can compute that which is not turing
computable.
until someone is willing to grant me an cs.LO endorsement i'm feeling
a bit hesitant to go further into the arguments... idk u could tempt
me prolly Efn+
i'm willing to post the section headers as of now:
I'm also a little hesitant I'll understand your paper, but the following section headers are indeed enticing.-a Will you put the paper up some-
where plebs like me can read them, once you publish?
1 the halting problem
2 the circle-free problem
-a-a2.1 turing's diagonal
-a-a2.2 a simpler form
3 the self-referential set-classification paradox generalized
-a-a3.1 clarification on self-reference
4 how undecidability is it?
-a-a4.1 reducing circle-free to halting
-a-a4.2 on the "existence" of recursive undecidability
5 rectifying EYou
-a-a5.1 bugfix: adding an identify check
-a-a5.2 bugfix: injecting a partial recognizer
-a-a5.3 a fallacy in turing's proof
6 the anti-diagonal problem
-a-a6.1 a proposed limit to undecidability within computing
-a-a6.2 a second fallacy in turing's paper
7 refuting the church turing thesis
-a-a7.1 the terminal machine
-a-a7.2 a record on the side
-a-a7.3 inject value and reduce
-a-a7.4 objective mechanics vs addressable simulation
On 27/08/2026 1:40 PM, dart200 wrote:
title of my next paper is tentative, but i'm kinda liking it. yes i'm
quite serious about refuting the church turing thesis. i demonstrate
how an idealized human agent can compute that which is not turing
computable.
until someone is willing to grant me an cs.LO endorsement i'm feeling
a bit hesitant to go further into the arguments... idk u could tempt
me prolly Efn+
i'm willing to post the section headers as of now:
I'm also a little hesitant I'll understand your paper, but the following section headers are indeed enticing.-a Will you put the paper up some-
where plebs like me can read them, once you publish?
1 the halting problem
2 the circle-free problem
-a-a2.1 turing's diagonal
-a-a2.2 a simpler form
3 the self-referential set-classification paradox generalized
-a-a3.1 clarification on self-reference
4 how undecidability is it?
-a-a4.1 reducing circle-free to halting
-a-a4.2 on the "existence" of recursive undecidability
5 rectifying EYou
-a-a5.1 bugfix: adding an identify check
-a-a5.2 bugfix: injecting a partial recognizer
-a-a5.3 a fallacy in turing's proof
6 the anti-diagonal problem
-a-a6.1 a proposed limit to undecidability within computing
-a-a6.2 a second fallacy in turing's paper
7 refuting the church turing thesis
-a-a7.1 the terminal machine
-a-a7.2 a record on the side
-a-a7.3 inject value and reduce
-a-a7.4 objective mechanics vs addressable simulation
On 8/27/26 7:34 AM, Ross Finlayson wrote:
On 08/26/2026 10:40 PM, dart200 wrote:
title of my next paper is tentative, but i'm kinda liking it. yes i'm
quite serious about refuting the church turing thesis. i demonstrate how >>> an idealized human agent can compute that which is not turing
computable.
until someone is willing to grant me an cs.LO endorsement i'm feeling a
bit hesitant to go further into the arguments... idk u could tempt me
prolly Efn+
i'm willing to post the section headers as of now:
1 the halting problem
2 the circle-free problem
-a 2.1 turing's diagonal
-a 2.2 a simpler form
3 the self-referential set-classification paradox generalized
-a 3.1 clarification on self-reference
4 how undecidability is it?
-a 4.1 reducing circle-free to halting
-a 4.2 on the "existence" of recursive undecidability
5 rectifying EYou
-a 5.1 bugfix: adding an identify check
-a 5.2 bugfix: injecting a partial recognizer
-a 5.3 a fallacy in turing's proof
6 the anti-diagonal problem
-a 6.1 a proposed limit to undecidability within computing
-a 6.2 a second fallacy in turing's paper
7 refuting the church turing thesis
-a 7.1 the terminal machine
-a 7.2 a record on the side
-a 7.3 inject value and reduce
-a 7.4 objective mechanics vs addressable simulation
What you might find is yourself establishing the _independence_
while a particular number can be computed by an idealize human agent
(the anti-diagonal across turing computable sequences),
it is necessary that said number is not turing computable lest a contradiction would be generated as per turing's original paper /on computable numbers/
of various ordinary theorems vis-a-vis their conjecture, from
usual ordinary theories that you'll be finding have implicits
and stipulations that while so seemingly innocuous or plain,
were always inside a box that declared itself open and closed.
| Sysop: | Amessyroom |
|---|---|
| Location: | Fayetteville, NC |
| Users: | 74 |
| Nodes: | 6 (0 / 6) |
| Uptime: | 01:09:12 |
| Calls: | 1,194 |
| Files: | 1,352 |
| Messages: | 290,957 |