Liste des Groupes | Revenir à s logic |
On 3/12/2024 12:36 PM, Richard Damon wrote:Of COURSE "H" referes to just a single instance at a time.On 3/12/24 9:02 AM, olcott wrote:∀ H ∈ Turing_Machine_Deciders *DOES NOT REFER TO A SINGLE INSTANCE*On 3/11/2024 10:57 PM, Richard Damon wrote:>On 3/11/24 8:37 PM, olcott wrote:>On 3/11/2024 10:31 PM, Richard Damon wrote:>On 3/11/24 7:52 PM, olcott wrote:>On 3/11/2024 9:32 PM, immibis wrote:\On 12/03/24 03:24, olcott wrote:>>Troll detected.>
>
Once we understand that either YES or NO is the right answer
Not for this decider/input question: Ĥ.H / ⟨Ĥ⟩ ⟨Ĥ⟩
For that decider/input question both YES and NO are the wrong answer.
The problem that you keeep on missing is that by the point we can ask this question, H and H^ are FULLY CODED, and thus we know their behavirs.
H.q0 ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qy // Ĥ applied to ⟨Ĥ⟩ halts
H.q0 ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qn // Ĥ applied to ⟨Ĥ⟩ does not halt
>
Since you know that is false why lie?
⊢* specifies an infinite set of encodings.
Nope, read him again, not just skim and assume.
>
*Here is the proof that I am correct*
∀ H ∈ Turing_Machine_Deciders
∃ TMD ∈ Turing_Machine_Descriptions |
Predicted_Behavior(H, TMD) != Actual_Behavior(TMD)
>
>
So, H, being an ELEMENT of Turing Machine Deciders, is a SINGLE INSTANCE of it, it is NOT the set itself.
https://en.wikipedia.org/wiki/List_of_logic_symbols
*This discussion has moved to my new post*
[Proving my 2004 claim that some decider/input pairs are incorrect questions]
>
You just don't understand categorical logic.
>
Yes, you can do this for ANY element, but the following logic is done one machine at a time.
Les messages affichés proviennent d'usenet.