Commit 2020-09-14 09:42 ed71b2df

feat(computability/tm_computable): define computable (in polytime) for TMs, prove id is computable in constant time (#4048) We define computability in polynomial time to be used in our future PR on P and NP. We also prove that id is computable in constant time.

<!-- put comments you want to keep out of the PR commit here -->