
Limited time only! Sign up for a free 30min personal tutor trial with Chegg TutorsDismiss Notice
Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!
Language that cannot be decided by a TM using space O(log n)
Have something to add?
 Similar Discussions: Language that cannot be decided by a TM using space O(log n)

Is log(n)^3 O(n^(1/3))? (Replies: 1)

Solving recurence T(n)=T(n1)+O(n lg n) (Replies: 1)

Prove that log(n!) ∈ Θ( nlog(n) ) (Replies: 10)
Loading...