5 ms·
Easy. Just use a language that isn’t Turing complete or require a proof of termination. All solved problems in the proof community.
by mbrodersen 5y ago
Easy. Just use a language that isn’t Turing complete or require a proof of termination. All solved problems in the proof community.