performance - The uncertainty principle of computer science -


when work on algorithm solve computing problem, experience speed can increased using more memory, , memory usage can decreased @ price of increased running time, but can never force product of running time , consumed memory below palpable limit. formally similar heisenberg's uncertainty principle: product of uncertainty in position , uncertainty in momentum of particle cannot less given threshold.

is there theorem of computer science, asserts same thing? guess should possible derive similar theory of turing machines.

i not familiar description of parallels heisenberg's uncertainty principle, per se, sounds me closely related computational complexity theory. problems can classified according inherent, irreducible complexity, , think that's you're getting @ limit of "the product of running time , consumed memory".


Comments

Popular posts from this blog

plot - Remove Objects from Legend When You Have Also Used Fit, Matlab -

java - Why does my date parsing return a weird date? -

Need help in packaging app using TideSDK on Windows -