Theories of complexity
β Scribed by Dominique Chu; Roger Strand; Ragnar Fjelland
- Publisher
- John Wiley and Sons
- Year
- 2003
- Tongue
- English
- Weight
- 158 KB
- Volume
- 8
- Category
- Article
- ISSN
- 1076-2787
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We investigate two constants c T and r T , introduced by Chaitin and Raatikainen respectively, defined for each recursively axiomatizable consistent theory T and universal Turing machine used to determine Kolmogorov complexity. Raatikainen argued that c T does not represent the complexity of T and f
It is proved in this paper that the predicate logic of each complete constructive arithmetic theory T having the existential property is T 1 -complete. In this connection, the techniques of a uniform partial truth deΓΏnition for intuitionistic arithmetic theories is used. The main theorem is applied
It has been suggested that biological theories differ from physical theories because the subject matter of biology differs from the subject matter of physics especially in the fact that living bodies are more complex than nonliving bodies. It is shown that the interactional complexity of living bodi