Computing and Information Technology Interactive Digital Educational Library


Planet Math Computer Science  >
Planet Math Computer Science Collection >

Please use this identifier to cite or link to this item:

Title: Kolmogorov complexity upper bounds
Issue Date: 4-Jul-2003
Publisher: PlanetMath
Abstract: ... This follows from the invariance theorem applied to a machine that copies the input (which is delimited with a blank) to the worktape and halts. ... This follows from a machine that works like
Appears in Collections:Planet Math Computer Science Collection

Files in This Item:

File SizeFormat

All items in DSpace are protected by copyright, with all rights reserved.


Valid XHTML 1.0! DSpace Software Copyright © 2002-2006 MIT and Hewlett-Packard - Feedback