•        0





Related Projects

Lv08-solution - LV08 Book Exercise Solution

LV08 An Intro. to Kolmogorov Complexity and Its Applications Exercise SolutionWhy LV08Occam's razor is the foundation of induction, and can even be severed as the foundation of science. Kolmogorov complexity allows us to quantify the complexity of an object, and thus provided a theoretical measure for model selection. LV08 is definitely one of the best books of introducing Kolmogorov Complexity. What's this project forThis project is accompanied by AIT reading group @ ANU How to join this projec

Androguard - Reverse engineering, Malware and goodware analysis of Android applications ... and more

Androguard (Android Guard) is a tool written in python to play with : .dex (Dalvik virtual machine) APK (Android application) Android's binary xml .class (Java virtual machine) JAR (Java application) To install androguard, please follow the link. Moreover, the roadmap and features are now available. You can play directly with Androguard by using ARE Virtual Machine : You can update the repository in tools/androguard with : hg pull && hg update because it's not the latest version in the vm Androg

Laforjadekolmogorov - La Forja de Kolmogorov

Espacio para darle forma a problemas de Probabilidad y Estadística.

Sg2 - 2D spectral Galerkin code written in CUDA C

Sg2 is a simple 2D spectral Galerkin hydrodynamic code written in CUDA C CONVENTIONS:let u be the two dimensional velocity. We define the stream function f such that u = curl(f). In component form, we have ux = df/dy, uy = -df/dx. It is fine that we do not distinguish between the scalar f and the vector (0, 0, f) in this README file. The vorticity is defined as w = curl(u). Similarly, we do not distinguish between w or (0, 0, w). It is clear that the stream function and the vorticity satisfy the

ks-test - Kolmogorov distribution and Kolmogorov-Smirnov test using the Haskell library "random-fu"

Kolmogorov distribution and Kolmogorov-Smirnov test using the Haskell library "random-fu"


this is cluster algorithm code based on Kolmogorov complexity, used in my Master Thesis.