Skip to content


Subversion checkout URL

You can clone with HTTPS or Subversion.

Download ZIP
Browse files

Kolmogorov complexity

  • Loading branch information...
commit 14b1d791a31a62e87e1aeee4705e02c28105d8f8 1 parent 6b780bf
@yang authored
Showing with 3 additions and 0 deletions.
  1. +3 −0 
3 
@@ -7,6 +7,9 @@ TODO merge in notes from CS172
- contains some easy P problems
- eg: dnf-sat, 2sat, permanent of a matrix, number of perfect matchings for a bipartite graph
+- _kolmogorov complexity_ of a string is min len of computer programming (in
+ some universal lang) to output that string
On Non-Computable Functions (Tibor Rado 1962)
- used TMs
Please sign in to comment.
Something went wrong with that request. Please try again.