I have often argued that computer scientists should be more interested in FPGAs and ASICs. Does the notion of Turing complete apply to a stack of LUTs? Look up tables are of course a nice mathematical generalisation. And how does that relate to prolog?