Article View: comp.compression.research
Article #126Re: C source for Fractal compression, huh !
From: William Tyler
Date: Sat, 21 Nov 1992 00:06
Date: Sat, 21 Nov 1992 00:06
15 lines
1185 bytes
1185 bytes
In article <1992Nov20.033432.18247@maths.tcd.ie> tim@maths.tcd.ie (Timothy Murphy) writes: >The informational content H(s) of a string >is the length of the shortest program >which will output the string >when fed into the universal Turing machine U. I.e. H(s) is only well-defined when you have selected U. For any string s, it is possible to construct a universal Turing machine U(s) that will output s given the one-symbol input program '0'. If you'll let me have a machine that will 'execute' an empty input tape, you don't even need the one-symbol program. -- Bill Tyler wtyler@adobe.com
Technical Details
Message-ID:
<1992Nov21.000615.22274@adobe.com>Path:
arc1-ca.pugleaf.net!sparky!uunet!zaphod.mps.ohio-state.edu!sample.eng.ohio-state.edu!purdue!decwrl!adobe!wtylerReferences:
<1992Nov18.024912.24072@maths.tcd.ie> <1992Nov18.083335.18739@adobe.com> <1992Nov20.033432.18247@maths.tcd.ie>Show Full Headers
Complete Article Headers
Newsgroups: comp.compression.research Path: arc1-ca.pugleaf.net!sparky!uunet!zaphod.mps.ohio-state.edu!sample.eng.ohio-state.edu!purdue!decwrl!adobe!wtyler From: wtyler@adobe.com (William Tyler) Subject: Re: C source for Fractal compression, huh ! Message-ID: <1992Nov21.000615.22274@adobe.com> Followup-To: comp.compression.research Sender: Bill Tyler Organization: Adobe Systems Inc., Mountain View, CA References: <1992Nov18.024912.24072@maths.tcd.ie> <1992Nov18.083335.18739@adobe.com> <1992Nov20.033432.18247@maths.tcd.ie> Date: Sat, 21 Nov 1992 00:06:15 GMT Lines: 15