Hacker News new | ask | show | jobs
by strbean 45 days ago
Well, assembly languages are generally Turing complete. Not sure what the parallel would be in proof engines.