TY - JOUR
T1 - An almost machine-independent theory of program-length complexity, sophistication, and induction
AU - Koppel, Moshe
AU - Atlan, Henri
PY - 1991/8
Y1 - 1991/8
N2 - The purpose of this paper is to use a variant of program-length complexity to formally define the structure of a binary string, where the structure of an object is taken to mean the aggregate of its projectible properties.
AB - The purpose of this paper is to use a variant of program-length complexity to formally define the structure of a binary string, where the structure of an object is taken to mean the aggregate of its projectible properties.
UR - http://www.scopus.com/inward/record.url?scp=0026205698&partnerID=8YFLogxK
U2 - 10.1016/0020-0255(91)90021-l
DO - 10.1016/0020-0255(91)90021-l
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0026205698
SN - 0020-0255
VL - 56
SP - 23
EP - 33
JO - Information Sciences
JF - Information Sciences
IS - 1-3
ER -