Thread Tree View: comp.compression.research
2 messages
Depth: 1
Cached
Build time: 1.178253msms
| 2 messages | Max depth: 1
Thread Tree
2 nodes
max depth: 1
1 leaves
Root Message
Kolmogorof complexity and data compression
From: Radford Neal
Date: Mon, 23 Nov 1992 16:19
Article: 130
Message-ID: <92Nov23.111932edt.584@neuron.ai.toronto.edu>
Debug Information
Tree Statistics
- Root Article: 130
- Message Count: 2
- Max Depth: 1
- Cache Hit: Yes
- Build Time: 1.178253ms
Thread Root
- Subject: Kolmogorof complexity and data compression
- From: Radford Neal
- Date: Mon, 23 Nov 1992 16:19
- Article: 130