Re:Rice’s Theorem: An interactive tutorial
by wizeman on Saturday November 26, 2022 @09:39AM
(#33753000)
As I said in my original post, Turing machines can be useful.
But they do a huge simplifying assumption which is that the program can use an infinite amount of memory.
This is OK in some cases, but it is not OK in others, especially when it comes to analyzing decidability.
For example, I think it is immensely useful to model computer programs in Turing-complete languages. I see no major reason why we should always use programming languages with enforced memory limits at the language level, currently.
Because, it's one thing to write a program, and it's another thing to execute it.
So, I'm not saying Turing machines are always inadequate. But I wish we would be more careful using them, so as to not make fundamental mistakes about what is true and what is false.
I'm truly interested in hearing your reasoning beyond "it is obvious to me." What background do you have in this field? Because if we wander over to the papers published in SAS we can look through the ways in which various systems model programs and they do not choose to model physical computers as FSMs. We've got decades of people thinking hard about this problem who've come down on the complete opposite side as you. Maybe literally the entire field is wrong about this. I doubt it.