Discrete mathematics/Computability

< Discrete mathematics

(Redirected from Computability theory (computer science))

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

Measuring Computational Complexity Edit

Counting Steps Edit

Performance Profiling Edit

Asymptotic Complexity Edit

Big-O Notation Edit

Little-O and Other Notations Edit

Analyzing Asymptotic Complexity Edit

NP-Completeness and Intractability Edit

Uncomputable problems Edit

The Halting Problem Edit

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