On Ultrametric Algorithmic Information

Details On Ultrametric Algorithmic Information On Ultrametric Algorithmic Information

2007-09-02

arxiv.org/abs/0709.0116v2

Computer Journal, 53, 405-416, 2010

Computer Science

Artificial Intelligence

Forthcoming, Computer Journal. Minor corrections 29 Oct. 2007

Scientific paper

10.1093/comjnl/bxm084

How best to quantify the information of an object, whether natural or artifact, is a problem of wide interest. A related problem is the computability of an object. We present practical examples of a new way to address this problem. By giving an appropriate representation to our objects, based on a hierarchical coding of information, we exemplify how it is remarkably easy to compute complex objects. Our algorithmic complexity is related to the length of the class of objects, rather than to the length of the object.

Affiliated with

Also associated with

No associations

Rating

On Ultrametric Algorithmic Information does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On Ultrametric Algorithmic Information, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Ultrametric Algorithmic Information will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-688883