Reputation
Next privilege 5 Rep.
Participate in meta
Badges
2
Newest
 Informed
Impact
~177 people reached

  • 0 posts edited
  • 0 helpful flags
  • 0 votes cast
Apr
7
awarded  Informed
Aug
21
awarded  Scholar
Aug
21
accepted DTIME and time hierarchy theorem
Aug
15
comment DTIME and time hierarchy theorem
I've been trying to understand it all day without much success. my (wrong) intuition keeps getting in the way and telling me that as long as the left side is o(f(n)) we have a strict subset - which seems to be wrong, --my question is about it begin a 'strict' subset - as for it being a 'just' a subset it is clear for me--. Digging in Sipser's "intro to theory of computation" i find that o(f(n)/log(n)) is the tightest limit known so far - which leads me to say that the answer to the above question is- that it is a subset though it isn't clear if it is strict (?)
Aug
15
asked DTIME and time hierarchy theorem