User talk:Tommyaweosme/hjhjhj

hjhjhj is uncomputable. Unname4798 08:50, 9 August 2024 (UTC)

Can a Turing machine solve a halting problem? If no, please re-categorize this page to Uncomputable. Unname4798 17:58, 9 August 2024 (UTC)

from esolangs wiki:

A programming language is said to be Turing-complete if every Turing machine has at least one corresponding program in the language which implements or simulates that machine.

tommyaweosme 18:36, 9 August 2024 (UTC)

But it can solve a halting problem, making it uncomputable. Unname4798 04:01, 10 August 2024 (UTC)

its uncomputable in one timeline, and turing-complete in another. please stop arguing over this. there are more timelines where this is turing-complete then there are uncomputable. there are infinite numbers between 0 and 1, but there is only one 0. the 0 is being uncomputable, having 0 in a row over and over. just one slip-up and the programming language is turing-complete. it could be uncomputable, but it is more turing-complete than uncomputable. infinitely more tommyaweosme 12:46, 10 August 2024 (UTC)

It would be uncomputable in all timelines, because hjhjhj won't modify the computability of this language. Unname4798 14:43, 10 August 2024 (UTC)