Fpgas Are Non Turing

The VonNeumannArchitecture makes the ChurchTuringThesis plausible. But FPGAs aren't VNA and never halt in any case. They are equivalent to the Turing C-Machine, about which Turing famously proved nothing. So all the Turing computability limits don't apply.