Grupper
Log ind
Grupper
comp.theory
Samtaler
Om
Send feedback
Hjælp
info
Google Grupper understøtter ikke længere nye Usenet-opslag eller -abonnementer. Tidligere indhold er fortsat synligt.
Dismiss
Flere oplysninger
comp.theory
Kontakt ejere og administratorer
1-30 af 46504
Markér alle som læst
Rapportér gruppe
Der er ikke valgt nogen
polcot2
, …
olcott
39
22. feb.
Converting Linz H applied to ⟨H⟩ ⟨H⟩ to its self contradictory version
On 2/22/2024 3:21 AM, Mikko wrote: > On 2024-02-22 02:43:15 +0000, olcott said: > >> On 2
ulæst,
Converting Linz H applied to ⟨H⟩ ⟨H⟩ to its self contradictory version
On 2/22/2024 3:21 AM, Mikko wrote: > On 2024-02-22 02:43:15 +0000, olcott said: > >> On 2
22. feb.
olcott
, …
Mikko
11
22. feb.
Ben Bacarisse inaccurate disparagement of my work
On 2/22/2024 3:01 AM, Mikko wrote: > On 2024-02-21 18:53:32 +0000, olcott said: > >> On 2
ulæst,
Ben Bacarisse inaccurate disparagement of my work
On 2/22/2024 3:01 AM, Mikko wrote: > On 2024-02-21 18:53:32 +0000, olcott said: > >> On 2
22. feb.
Ben Bacarisse
, …
olcott
42
22. feb.
Linz's proofs.
On 2/22/2024 2:58 AM, Mikko wrote: > On 2024-02-20 14:16:55 +0000, olcott said: > >> On 2
ulæst,
Linz's proofs.
On 2/22/2024 2:58 AM, Mikko wrote: > On 2024-02-20 14:16:55 +0000, olcott said: > >> On 2
22. feb.
immibis
, …
Richard Damon
24
22. feb.
I got a reply from Professor Macias [he does not know about Turing machines]
On 2/22/24 12:19 AM, olcott wrote: > On 2/21/2024 11:10 PM, immibis wrote: >> On 22/02/24 03
ulæst,
I got a reply from Professor Macias [he does not know about Turing machines]
On 2/22/24 12:19 AM, olcott wrote: > On 2/21/2024 11:10 PM, immibis wrote: >> On 22/02/24 03
22. feb.
wij
, …
Ben Bacarisse
3
21. feb.
ℙ≠ℕℙ proof ('official')
wij <wyni...@gmail.com> writes: Your argument is just the usual "I can't think how it
ulæst,
ℙ≠ℕℙ proof ('official')
wij <wyni...@gmail.com> writes: Your argument is just the usual "I can't think how it
21. feb.
Dan Cross
, …
Richard Damon
194
20. feb.
Purpose of this group?
On 2/20/24 8:59 AM, olcott wrote: > On 2/20/2024 6:34 AM, Richard Damon wrote: >> On 2/19/24
ulæst,
Purpose of this group?
On 2/20/24 8:59 AM, olcott wrote: > On 2/20/2024 6:34 AM, Richard Damon wrote: >> On 2/19/24
20. feb.
olcott
, …
Richard Damon
50
19. feb.
Linz H' is merely the self-contradictory form of Linz H applied to ⟨H⟩
On 2/19/2024 6:48 AM, Richard Damon wrote: > On 2/19/24 12:58 AM, olcott wrote: >> On 2/18/
ulæst,
Linz H' is merely the self-contradictory form of Linz H applied to ⟨H⟩
On 2/19/2024 6:48 AM, Richard Damon wrote: > On 2/19/24 12:58 AM, olcott wrote: >> On 2/18/
19. feb.
immibis
19. feb.
x=2-x is self-referential, therefore unsolvable
"x=2-x. What is x (natural number)?" is self-referential. Self-referential questions have
ulæst,
x=2-x is self-referential, therefore unsolvable
"x=2-x. What is x (natural number)?" is self-referential. Self-referential questions have
19. feb.
olcott
, …
immibis
67
18. feb.
Linz Ĥ applied to ⟨Ĥ⟩ is the self-contradictory form of Olcott Ȟ applied to ⟨Ȟ⟩
On 18/02/24 23:36, olcott wrote: > On 2/18/2024 12:22 PM, Richard Damon wrote: >> On 2/18/24
ulæst,
Linz Ĥ applied to ⟨Ĥ⟩ is the self-contradictory form of Olcott Ȟ applied to ⟨Ȟ⟩
On 18/02/24 23:36, olcott wrote: > On 2/18/2024 12:22 PM, Richard Damon wrote: >> On 2/18/24
18. feb.
wij
,
immibis
4
18. feb.
ℙ!=ℕℙ proof
On 18/02/24 10:51, wij wrote: > On Mon, 2024-02-05 at 20:59 +0100, immibis wrote: >> On 2/02
ulæst,
ℙ!=ℕℙ proof
On 18/02/24 10:51, wij wrote: > On Mon, 2024-02-05 at 20:59 +0100, immibis wrote: >> On 2/02
18. feb.
olcott
, …
Richard Damon
181
16. feb.
When the Linz Ĥ is required to report on its own behavior both answers are wrong
On 2/16/24 5:56 PM, olcott wrote: > On 2/16/2024 4:08 PM, Richard Damon wrote: >> On 2/16/24
ulæst,
When the Linz Ĥ is required to report on its own behavior both answers are wrong
On 2/16/24 5:56 PM, olcott wrote: > On 2/16/2024 4:08 PM, Richard Damon wrote: >> On 2/16/24
16. feb.
wij
, …
immibis
3
16. feb.
A problem about prime number
On 16/02/24 22:12, wij wrote: > I just wrote a short c++ program to test prime numbers. The
ulæst,
A problem about prime number
On 16/02/24 22:12, wij wrote: > I just wrote a short c++ program to test prime numbers. The
16. feb.
olcott
, …
Richard Damon
66
12. feb.
Refuting the Tarski Undefinability Theorem
On 2/11/24 11:31 PM, olcott wrote: > On 2/11/2024 9:24 PM, Richard Damon wrote: >> On 2/11/
ulæst,
Refuting the Tarski Undefinability Theorem
On 2/11/24 11:31 PM, olcott wrote: > On 2/11/2024 9:24 PM, Richard Damon wrote: >> On 2/11/
12. feb.
Ross Finlayson
11. feb.
Re: Question words, and what's an answer
On 08/05/2023 05:27 PM, Ross Finlayson wrote: > On Sunday, June 18, 2023 at 9:29:01 PM UTC-7, Ross
ulæst,
Re: Question words, and what's an answer
On 08/05/2023 05:27 PM, Ross Finlayson wrote: > On Sunday, June 18, 2023 at 9:29:01 PM UTC-7, Ross
11. feb.
olcott
, …
Richard Damon
27
5. feb.
To understand the misconception of mathematical incompleteness...
On 2/5/24 9:45 AM, olcott wrote: > On 2/5/2024 6:33 AM, Richard Damon wrote: >> On 2/4/24 11
ulæst,
To understand the misconception of mathematical incompleteness...
On 2/5/24 9:45 AM, olcott wrote: > On 2/5/2024 6:33 AM, Richard Damon wrote: >> On 2/4/24 11
5. feb.
immibis
, …
Richard Damon
41
5. feb.
Why does Olcott continue to ignore the finite/infinite sequence formulation of the halting problem?
On 2/5/24 2:41 PM, immibis wrote: > On 1/02/24 04:26, Richard Damon wrote: >> On 1/31/24 9:
ulæst,
Why does Olcott continue to ignore the finite/infinite sequence formulation of the halting problem?
On 2/5/24 2:41 PM, immibis wrote: > On 1/02/24 04:26, Richard Damon wrote: >> On 1/31/24 9:
5. feb.
wij
, …
Ross Finlayson
994
5. feb.
Another rebuttal of Halting Problem?
On 02/05/2024 01:00 PM, immibis wrote: > On 31/01/24 18:11, olcott wrote: >> On 1/31/2024 11
ulæst,
Another rebuttal of Halting Problem?
On 02/05/2024 01:00 PM, immibis wrote: > On 31/01/24 18:11, olcott wrote: >> On 1/31/2024 11
5. feb.
olcott
, …
immibis
84
5. feb.
Re: The Psychology of Self-Reference
On 31/01/24 18:11, immibis wrote: > On 1/31/24 16:40, olcott wrote: >> On 1/31/2024 6:30 AM,
ulæst,
Re: The Psychology of Self-Reference
On 31/01/24 18:11, immibis wrote: > On 1/31/24 16:40, olcott wrote: >> On 1/31/2024 6:30 AM,
5. feb.
olcott
, …
immibis
15
5. feb.
H correctly rejects D as non-halting
On 4/02/24 00:14, olcott wrote: > On 2/3/2024 4:16 PM, Richard Damon wrote: >> On 2/3/24 4:
ulæst,
H correctly rejects D as non-halting
On 4/02/24 00:14, olcott wrote: > On 2/3/2024 4:16 PM, Richard Damon wrote: >> On 2/3/24 4:
5. feb.
olcott
, …
immibis
19
5. feb.
Does this criteria prove that Y calls X in infinite recursion?
On 2/02/24 15:46, olcott wrote: > On 2/2/2024 4:49 AM, Mikko wrote: >> On 2024-02-01 17:17:
ulæst,
Does this criteria prove that Y calls X in infinite recursion?
On 2/02/24 15:46, olcott wrote: > On 2/2/2024 4:49 AM, Mikko wrote: >> On 2024-02-01 17:17:
5. feb.
olcott
, …
Richard Damon
10
31. jan.
H is necessarily correct to reject D as non-halting [tautology]
On 1/31/24 10:41 AM, olcott wrote: > On 1/31/2024 6:31 AM, immibis wrote: >> On 1/31/24 04:
ulæst,
H is necessarily correct to reject D as non-halting [tautology]
On 1/31/24 10:41 AM, olcott wrote: > On 1/31/2024 6:31 AM, immibis wrote: >> On 1/31/24 04:
31. jan.
wij
31. jan.
Easy version of P!=NP proof
ANPC::= (Another NPC) Set of decision problems that additional information c must be provided to
ulæst,
Easy version of P!=NP proof
ANPC::= (Another NPC) Set of decision problems that additional information c must be provided to
31. jan.
immibis
29. jan.
Another definition of the Halting Problem
Every Turing machine/input pair has an execution sequence (term invented by me. Richard and Mikko
ulæst,
Another definition of the Halting Problem
Every Turing machine/input pair has an execution sequence (term invented by me. Richard and Mikko
29. jan.
immibis
28. jan.
Every Turing machine/input pair has one and only one execution sequence
Olcott cannot show any Turing machine/input pair that has more than one.
ulæst,
Every Turing machine/input pair has one and only one execution sequence
Olcott cannot show any Turing machine/input pair that has more than one.
28. jan.
olcott
, …
immibis
24
28. jan.
The directly executed D(D) does not halt even though it looks like it does
On 1/28/24 01:35, olcott wrote: > On 1/27/2024 6:15 PM, Richard Damon wrote: >> On 1/27/24 6
ulæst,
The directly executed D(D) does not halt even though it looks like it does
On 1/28/24 01:35, olcott wrote: > On 1/27/2024 6:15 PM, Richard Damon wrote: >> On 1/27/24 6
28. jan.
wij
,
Mikko
6
27. jan.
About building a "general logic based on computation"
On Sat, 2024-01-27 at 11:49 +0200, Mikko wrote: > On 2024-01-21 16:10:34 +0000, wij said: >
ulæst,
About building a "general logic based on computation"
On Sat, 2024-01-27 at 11:49 +0200, Mikko wrote: > On 2024-01-21 16:10:34 +0000, wij said: >
27. jan.
olcott
, …
Richard Damon
279
27. jan.
Michael Sipser of MIT validates the notion of a simulating halt decider
On 1/27/24 11:22 AM, olcott wrote: > On 1/27/2024 6:28 AM, immibis wrote: >> On 1/27/24 00:
ulæst,
Michael Sipser of MIT validates the notion of a simulating halt decider
On 1/27/24 11:22 AM, olcott wrote: > On 1/27/2024 6:28 AM, immibis wrote: >> On 1/27/24 00:
27. jan.
olcott
, …
immibis
12
25. jan.
The directly executed D(D) does not halt
On 1/25/24 16:04, olcott wrote: > On 1/25/2024 7:16 AM, immibis wrote: >> On 1/24/24 20:10,
ulæst,
The directly executed D(D) does not halt
On 1/25/24 16:04, olcott wrote: > On 1/25/2024 7:16 AM, immibis wrote: >> On 1/24/24 20:10,
25. jan.
olcott
, …
Richard Damon
3
24. jan.
Tarski anchors his whole proof in the Liar Paradox
On 1/24/24 12:46 PM, olcott wrote: > *Tarski anchors his whole proof in the Liar Paradox* >
ulæst,
Tarski anchors his whole proof in the Liar Paradox
On 1/24/24 12:46 PM, olcott wrote: > *Tarski anchors his whole proof in the Liar Paradox* >
24. jan.
wij
, …
Mikko
12
24. jan.
Is this a paradox? what is 'equal'?
On 2024-01-23 18:46:52 +0000, wij said: > https://en.wikipedia.org/wiki/Set_(mathematics) > A
ulæst,
Is this a paradox? what is 'equal'?
On 2024-01-23 18:46:52 +0000, wij said: > https://en.wikipedia.org/wiki/Set_(mathematics) > A
24. jan.