Liste des Groupes | Revenir à theory |
On 5/14/2024 4:44 AM, Mikko wrote:That notation is not any better for the purpose.On 2024-05-12 15:58:02 +0000, olcott said:00 int H(ptr x, ptr x) // ptr is pointer to int function
On 5/12/2024 10:21 AM, Mikko wrote:This notation does not work with machines that can, or have partsOn 2024-05-12 11:34:17 +0000, Richard Damon said:When Ĥ is applied to ⟨Ĥ⟩
On 5/12/24 5:19 AM, Mikko wrote:Here one can claim whatever one wants anysay.On 2024-05-11 16:26:30 +0000, olcott said:I think he means, he is working on a definition that redefines the field to allow him to claim what he wants.
I am working on providing an academic quality definition of thisThe definition in Wikipedia is good enough.
term.
In if one wants to present ones claims on some significant forum then
it is better to stick to usual definitions as much as possible.
Sort of like his new definition of H as an "unconventional" machine that some how both returns an answer but also keeps on running.There are systems where that is possible but unsolvable problems are
unsolvable even in those systems.
Ĥ.q0 ⟨Ĥ⟩ ⊢* embedded_H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qy ∞
Ĥ.q0 ⟨Ĥ⟩ ⊢* embedded_H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn
that can, return a value without (or before) termination.
01 int D(ptr x)
02 {
03 int Halt_Status = H(x, x);
04 if (Halt_Status)
05 HERE: goto HERE;
06 return Halt_Status;
07 }
08
09 int main()
10 {
11 H(D,D);
12 }
Les messages affichés proviennent d'usenet.