Occam bound on lowest complexity of elements

Annals of Pure and Applied Logic 167 (10):897-900 (2016)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,813

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Interpolation by a Game.Jan Kraíček - 1998 - Mathematical Logic Quarterly 44 (4):450-458.
Blunting Occam's razor: aligning medical education with studies of complexity.Alan Bleakley - 2010 - Journal of Evaluation in Clinical Practice 16 (4):849-855.
Is Occam's Razor a Physical Thing?J. J. C. Smart - 1978 - Philosophy 53 (205):382 - 385.
Kolmogorov complexity for possibly infinite computations.Verónica Becher & Santiago Figueira - 2005 - Journal of Logic, Language and Information 14 (2):133-148.

Analytics

Added to PP
2016-07-09

Downloads
17 (#890,390)

6 months
1 (#1,507,095)

Historical graph of downloads
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