Computational complexity: Difference between revisions

Content deleted Content added
D.Lazard, stop spreading shit over Wiki pages) Undid revision 1217025972 by D.Lazard (talk)
Tags: Undo Reverted Non-autoconfirmed user rapidly reverting edits
Undid revision 1218042027 by 106.220.90.222 (talk)
Line 47:
 
==Models of computation==
The evaluation of the complexity relies on the choice of a [[model of computation]], which consists in defining the basic operations that are done in a unit of time. When the model of computation is not explicitly specified, thisit is generally{{According toimplicitely whom|date=April 2024}} meantassumed as being a [[multitape Turing machine]], since several more realistic models of computation, such as [[random-access machine]]s are asymptotically equivalent for most problems. It is only for very specific and difficult problems, such as [[integer multiplication]] in time <math>O(n\log n),</math> that the explicit definition of the model of computation is required for proofs.
 
===Deterministic models===