Computing and Information Technology Interactive Digital Educational Library

 

CITIDEL >
Planet Math Computer Science  >
Planet Math Computer Science Collection >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10117/1268

Title: Kolmogorov complexity upper bounds
Issue Date: 4-Jul-2003
Publisher: PlanetMath
Citation: http://planetmath.org/encyclopedia/KolmogorovComplexityUpperBounds.html
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
URI: http://www.citidel.org/handle/10117/1268
Appears in Collections:Planet Math Computer Science Collection

Files in This Item:

File SizeFormat
KolmogorovComplexityUpperBounds.html21KbHTMLView/Open

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