Treffer: Two philosophical applications of algorithmic information theory
Title:
Two philosophical applications of algorithmic information theory
Authors:
Source:
DMTCS 2003 : discrete mathematics and theoretical computer science (Dijon, 7-12 July 2003)Lecture notes in computer science. :1-10
Publisher Information:
Berlin: Springer, 2003.
Publication Year:
2003
Physical Description:
print, 17 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Mathematics, Mathématiques, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Logiciel, Software, Généralités, General, Algorithmique, Algorithmics, Algorítmica, Complexité programme, Program complexity, Complejidad programa, Informatique théorique, Computer theory, Informática teórica, Mathématiques discrètes, Discrete mathematics, Matemáticas discretas, Partition, Partición, Philosophie, Philosophy, Filosofía, Programme application, Application program, Programa aplicación, Théorie information, Information theory, Teoría información
Document Type:
Konferenz
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
IBM Research Division, P.O. Box 218, Yorktown Heights, NY 10598, United States
ISSN:
0302-9743
Rights:
Copyright 2004 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.15690988
Database:
PASCAL Archive
Weitere Informationen
Two philosophical applications of the concept of program-size complexity are discussed. First, we consider the light program-size complexity sheds on whether mathematics is invented or discovered, i.e., is empirical or is a priori. Second, we propose that the notion of algorithmic independence sheds light on the question of being and how the world of our experience can be partitioned into separate entities.