Talk:Ultimate Golfing Simulator 3000

From Esolang
Jump to navigation Jump to search

what about UTM programs?

in the last line, it says:
"However, no language is itself Turing complete."
are not languages corresponding to UTMs TC? --Pro465 (talk) 05:32, 25 September 2023 (UTC)

I don't think so, you can't compile any Turing machine into any of these languages, because there is only one possible program in every language --None1 (talk) 13:20, 25 September 2023 (UTC)

It's easy to translate though: just input those programs into the UTM, along with their inputs. --Pro465 (talk) 15:01, 25 September 2023 (UTC)
They can be said to be ℒ-equivalent, whether that suffices for Turing completeness is up to interpretation. Rdococ (talk) 22:59, 12 December 2023 (UTC)
Retrieved from "https://esolangs.org/w/index.php?title=Talk:Ultimate_Golfing_Simulator_3000&oldid=120511"