Talk:Turing machine

message: The section "Comparison with real machines" consists almost entirely of misleading if not outright false statements, from beginning to end. Crazy stuff, like "Like a Turing machine, a real machine can have its storage space enlarged as needed," Uh, no; Turing machines can't/don't "enlarge" their memory. They already have an unbounded amount. Or this blooper:  "There is a limit to the memory possessed by any current machine, but this limit can rise arbitrarily in time." Uh, no, not "arbitrarily", but only as much as vendors can manufacture. Ultimately limited by the number of atoms on the Earth, or Solar System, or Universe. By comparison, Turing machines have a literally unbounded amount. Or this entire paragraph: "Descriptions of real machine programs using simpler abstract models are often much more complex than descriptions using Turing machines. For example, a Turing machine describing an algorithm may have a few hundred states, while the equivalent deterministic finite automaton (DFA) on a given real machine has quadrillions. This makes the DFA representation infeasible to analyze." Each sentence of this last is patently wrong in more than one way. The errors continue onwards in later subsections of this section. Personally, I recommend nuking the entire section, and starting from scratch. But that would probably raise a hornet's nest that I don't want to engage in; so I'd rather leave this drive-by comment. Surely the regular maintainers of this article can do much better. 67.198.37.16 (talk) 04:43, 29 November 2023 (UTC)
replies: text: You seem very angry at nobody in particular about what are pretty incidental inaccuracies at best, that don't really damage the core understanding of what a Turing machine is or why it's a useful model. Would you like to work with fellow editors to improve the article, or would you prefer to remain totally gobsmacked because a paragraph in an article about an abstract algorithmic object fails to account for the finite number of atoms in the universe in an analogy? Remsense留 05:00, 29 November 2023 (UTC)
replies: text: Oh, gobsmacked, definitely. These are not "incidental inaccuracies", they are fundamental misunderstandings of the core concept. I imagine this section has been read by millions of high-school and college students, and as a result has successfully planted some serious misunderstandings of what Turing machines are. We demand accuracy and correctness from other WP articles; I don't see why this article should get a free pass. 67.198.37.16 (talk) 05:39, 29 November 2023 (UTC)
thread_title:  False statements in section "Comparison with real machines" 

message: While the recently added section Turing machine#Comparison with the arithmetic model of computation is quite interesting, I'm afraid it is of undue weight here. Moreover, it confuses readers by apparently suggesting that each real number can be represented in a Turing machine. I suggest that the detailled discussion of comparison is moved to arithmetic model of computation (if not already present there), and that a one-paragraph summary is added to some appropriate section of Turing machine, without an own [sub]section header. - Jochen Burghardt (talk) 20:21, 28 January 2024 (UTC)
thread_title:  Comparison with the arithmetic model of computation 

message: Hi I came here to say that I think this article’s reading level is too high. The article also assumes the reader has specialized knowledge and this makes the article incomprehensible to many who would benefit from an “explain like I’m five” approach to this subject matter. 74.101.116.31 (talk) 10:15, 24 March 2024 (UTC)
replies: text: What specifically do you have trouble with? I believe articles should be such that non-experts can easily read them to grasp the essence of a topic, as far as possible without taking a course on the prerequisites. At some point, you do need prerequisite knowledge. The Turing machine itself is certainly simple enough to be easy to explain to a five year old. However, the point of the Turing machine can only be understood given an understanding of the basics of mathematical logic. This is a university level topic and it usually requires a course to master. Explaining those things is far beyond the scope of this article, and teaching things is for Wikibooks. So I think the best we can do is structure the material in such a way that the machine itself is presented first, and its purpose is described next, first in general terms that a non-expert can understand, then in detail. At some point, the non-expert will give up, but with the right pointers, they will at least know where to continue for further learning. Rp (talk) 11:44, 24 March 2024 (UTC)
thread_title:  Reading Level