AtomSeek the directory or science  

Math: Logic and Foundations: Computational Logic: Combinatory Logic and Lambda Calculus: Kolmogorov Complexity in Combinatory Logic
  Home: Math: Logic and Foundations: Computational Logic: Combinatory Logic and Lambda Calculus:
Submitted: Sat Sep 06 2003
Title:

Math: Logic and Foundations: Computational Logic: Combinatory Logic and Lambda Calculus: Kolmogorov Complexity in Combinatory Logic


URL: http://www.cwi.nl/~tromp/cl/cl.html

 

Description: Online article by John Tromp. Kolmogorov complexity is a recursion theoretic characterisation of randomness.
Detailed Traffic Statistic From Alexa
Detailed Traffic Statistic From Alexa

 
  Previous      Next

  HOME | ADD A LINK | MODIFY A LINK | LOGIN


Open forum for all scientific topics!
Excellent source of information to study.
This forum is place to talk with interesting people


© atomseek.com
Webmaster - miroweb.com