2 ms·

Well, assembly languages are generally Turing complete. Not sure what the parallel would be in proof engines.

• rowanG077 5mo ago
  [dead]