Liste des Groupes | Revenir à theory |
On 4/28/2025 4:14 AM, Mikko wrote:On 2025-04-26 15:59:39 +0000, olcott said:On 4/26/2025 3:19 AM, Mikko wrote:On 2025-04-25 16:31:58 +0000, olcott said:On 4/25/2025 3:46 AM, Mikko wrote:
Yes there is a universally agreed upon definition of TMs. You may pickSince there is no universally agreed upon definition of the TuringAttempt to deceive by a false claim. The term "computable function" isStrawman deception error of changing the subject away from computableTuring allowed Turing machines to do whatever they can do.Trying to refute. You have not shown any defect in that proof ofNot at all. You have simply not been paying enough attention.
the theorem. There are other proofs that you don't even try to
refute.
Once we understand that Turing computable functions are only allowed
functions.
defined in terms of Turing machines so Turing machines are on topic.
Machine language it is impossible to provide the 100% concrete details
in this Turing Machine language.
Les messages affichés proviennent d'usenet.