Re:Parse, Don't Validate (2019)
by ukj on Saturday June 26, 2021 @04:20PM
(#27645469)
I am interested in computation. Period. Not any particular model of computation (programming language); and not merely computation with functions from N->N.
"The lesson is for those “experts” who “know” that all reasonable models of computation are equivalent to Turing machines. This is true if one looks just at functions from N to N. However, at higher types, questions of representation become important, and it does matter which model of computation is used."
Quoting from "http://math.andrej.com/2006/03/27/sometimes-all-functions-ar..."
"The lesson is for those “experts” who “know” that all reasonable models of computation are equivalent to Turing machines. This is true if one looks just at functions from N to N. However, at higher types, questions of representation become important, and it does matter which model of computation is used."