Discrete mathematics/Computability
From Wikiversity
<
Discrete mathematics
(Redirected from
Computability theory (computer science)
)
Jump to navigation
Jump to search
<
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
|
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
Navigation menu
Personal tools
Not logged in
Talk
Contributions
Create account
Log in
Namespaces
Resource
Discuss
English
Views
Read
Edit
Edit source
View history
More
Search
Navigation
Main Page
Browse
Recent changes
Guided tours
Random
Help
Donate
community
Portal
Colloquium
News
Projects
Sandbox
Tools
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 languages
Add links