Are polynomially clocked Turing machines necessary? #3

Open
jfinkels opened this Issue May 21, 2012 · 0 comments

Comments

Projects
None yet
1 participant
Owner

jfinkels commented May 21, 2012

Are polynomially clocked Turing machines necessary in our phrasing of thm:generalcompleteness in generalcompleteness.tex?

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment