Jump to content
Main menu
Main menu
move to sidebar
hide
Navigation
Main Page
Browse
Recent changes
Guided tours
Random
Help
Community
Portal
Colloquium
News
Projects
Sandbox
Search
Search
Appearance
Donate
Create account
Log in
Personal tools
Donate
Create account
Log in
Pages for logged out editors
learn more
Contributions
Talk
Contents
move to sidebar
hide
Beginning
1
Measuring Computational Complexity
Toggle Measuring Computational Complexity subsection
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
Toggle Uncomputable problems subsection
4.1
The Halting Problem
Toggle the table of contents
Discrete mathematics/Computability
Add languages
Add links
Resource
Discuss
English
Read
Edit
Edit source
View history
Tools
Tools
move to sidebar
hide
Actions
Read
Edit
Edit source
View history
General
What links here
Related changes
Special pages
Permanent link
Page information
Cite this page
Get shortened URL
Download QR code
Wikimedia Projects
Commons
Wikibooks
Wikidata
Wikinews
Wikipedia
Wikiquote
Wikisource
Wikispecies
Wikivoyage
Wiktionary
Meta-Wiki
Outreach
MediaWiki
Wikimania
Print/export
Create a book
Download as PDF
Printable version
In other projects
Appearance
move to sidebar
hide
From Wikiversity
<
Discrete mathematics
<
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
]
Categories
:
School of Computer Science
Computability theory
