Kolmogorov complexity and characteristic constants of formal theories of arithmetic

, &
Mathematical Logic Quarterly 57 (5):470-473 (2011)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Kolmogorov complexity and characteristic constants of formal theories of arithmetic.Shingo Ibuka, Makoto Kikuchi & Hirotaka Kikyo - 2011 - Mathematical Logic Quarterly 57 (5):470-473.
On interpreting Chaitin's incompleteness theorem.Panu Raatikainen - 1998 - Journal of Philosophical Logic 27 (6):569-586.
Kolmogorov complexity and information theory. With an interpretation in terms of questions and answers.Peter D. Grünwald & Paul M. B. Vitányi - 2003 - Journal of Logic, Language and Information 12 (4):497-529.
Towards a stable definition of algorithmic randomness.Hector Zenil - unknown
Kolmogorov complexity for possibly infinite computations.Verónica Becher & Santiago Figueira - 2005 - Journal of Logic, Language and Information 14 (2):133-148.
Kolmogorov complexity and the second incompleteness theorem.Makoto Kikuchi - 1997 - Archive for Mathematical Logic 36 (6):437-443.
Kolmogorov complexity estimates for detection of viruses in biologically inspired security systems: A comparison with traditional approaches.Sanjay Goel & Stephen F. Bush - 2003 - Complexity 9 (2):54-73.
Kolmogorov Complexity and Noncomputability.George Davie - 2002 - Mathematical Logic Quarterly 48 (4):574-581.
Program Size Complexity for Possibly Infinite Computations.Verónica Becher, Santiago Figueira, André Nies & Silvana Picchi - 2005 - Notre Dame Journal of Formal Logic 46 (1):51-64.
Kolmogorov complexity and set theoretical representations of integers.Marie Ferbus-Zanda & Serge Grigorieff - 2006 - Mathematical Logic Quarterly 52 (4):375-403.
The K -Degrees, Low for K Degrees,and Weakly Low for K Sets.Joseph S. Miller - 2009 - Notre Dame Journal of Formal Logic 50 (4):381-391.
Presenting the formal theory of hierarchical complexity.Michael Lamport Commons & Alexander Pekker - 2008 - World Futures 64 (5-7):375 – 382.
Relative Kolmogorov complexity and geometry.Stephen Binns - 2011 - Journal of Symbolic Logic 76 (4):1211-1239.
Arithmetic complexity of the predicate logics of certain complete arithmetic theories.Valery Plisko - 2001 - Annals of Pure and Applied Logic 113 (1-3):243-259.
Arithmetic Complexity of the Predicate Logics of Complete Arithmetic Theories.Valeri Plisko - 2003 - In A. Rojszczak, J. Cachro & G. Kurczewski (eds.), Philosophical Dimensions of Logic and Science. Kluwer Academic Publishers. pp. 57--66.

Analytics

Added to PP
2013-12-01

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references