Home
Random
Log in
Settings
Donate
About Wikiversity
Disclaimers
Search
Discrete mathematics/Computability
Language
Watch
Edit
<
Discrete mathematics
(Redirected from
Computability theory (computer science)
)
<
Wikiversity
<
Wikiversity:School of Computer Science
<
Wikiversity:Theory
Contents
1
Measuring Computational Complexity
1.1
Counting Steps
1.2
Performance Profiling
1.3
Asymptotic Complexity
1.3.1
Big-O Notation
1.3.2
Little-O and Other Notations
2
Analyzing Asymptotic Complexity
3
NP-Completeness and Intractability
4
Uncomputable problems
4.1
The Halting Problem
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