Comment by strbean

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