Discrete mathematics/Computability

From Wikiversity

< Discrete mathematics

Jump to navigation Jump to search

< Wikiversity < Wikiversity:School of Computer Science < Wikiversity:Theory

Measuring Computational Complexity[edit | edit source]

Counting Steps[edit | edit source]

Performance Profiling[edit | edit source]

Asymptotic Complexity[edit | edit source]

Big-O Notation[edit | edit source]

Little-O and Other Notations[edit | edit source]

Analyzing Asymptotic Complexity[edit | edit source]

NP-Completeness and Intractability[edit | edit source]

Uncomputable problems[edit | edit source]

The Halting Problem[edit | edit source]

Retrieved from "https://en.wikiversity.org/w/index.php?title=Discrete_mathematics/Computability&oldid=2613719"