The lookup table thought experiment shows that the answer is computable! That's a big deal, or perhaps used to be a big deal.
Yes, from an complexity theory or engineering point of view the lookup table is pointless, of course.
Yes, from an complexity theory or engineering point of view the lookup table is pointless, of course.
The second you assert that the lookup table can pass a turing test with, eg. a gigabyte of exchange, then the table of every single one gigabyte number in it becomes your state space and program, the page number becomes the state, and you've got just as much complexity as any other simulation with one gigabyte of state. You haven't changed the parameters of the problem at all.