Since I can manually implement any computation a Turing machine can, for some subsystem of me, that table will have to contain the “full computation” table that checks every possible computation for whether it halts before I die. I submit such a table is not very interesting.
A LUT can handle change, if it encodes a function of type (Input × State) → (Output × State).
Since I can manually implement any computation a Turing machine can, for some subsystem of me, that table will have to contain the “full computation” table that checks every possible computation for whether it halts before I die. I submit such a table is not very interesting.
I submit that such a table is not particularly less interesting than a Turing machine.