SubIndex on Chaitin,GJ (BibTex)
Click on the desired item or article for more information.- Chaitin,GJ; 1994, Randomness and Complexity in Pure Mathematics, International Journal of Bifurcation and Chaos, 4, 3-15
- Chaitin,GJ; 1987, Algorithmic Information Theory, Cambridge University Press, Cambridge
- Chaitin,GJ; 1977, Algorithmic Information Theory, IBM Journal of Research and Development, 21, 350-9,496
- Chaitin,GJ; 1966, On the Length of Programs for Computing Finite Binary Sequences, Journal of the Association of Computing Machinery, 13, 547-569
| Top | Authors | Journals | Years | Keywords | Search | New | Comments |
Bruce Edmonds, Centre for Policy Modelling, Manchester Metropolitan University