A proof challenge: multiple alignment and information compression

03/04/2014
by   J Gerard Wolff, et al.
0

These notes pose a "proof challenge": a proof, or disproof, of the proposition that "For any given body of information, I, expressed as a one-dimensional sequence of atomic symbols, a multiple alignment concept, described in the document, provides a means of encoding all the redundancy that may exist in I. Aspects of the challenge are described.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/18/2023

Universal Proof Theory, TACL 2022 Lecture Notes

The subject of these short lecture notes is a recently emerging area wit...
research
03/08/2013

Computing as compression: the SP theory of intelligence

This paper provides an overview of the SP theory of intelligence and its...
research
09/07/2020

A Simpler NP-Hardness Proof for Familial Graph Compression

This document presents a simpler proof showcasing the NP-hardness of Fam...
research
03/08/2013

Application of the SP theory of intelligence to the understanding of natural vision and the development of computer vision

The SP theory of intelligence aims to simplify and integrate concepts in...
research
04/03/2017

Brief Notes on Hard Takeoff, Value Alignment, and Coherent Extrapolated Volition

I make some basic observations about hard takeoff, value alignment, and ...
research
07/29/2021

SyncUp: Vision-based Practice Support for Synchronized Dancing

The beauty of synchronized dancing lies in the synchronization of body m...

Please sign up or login with your details

Forgot password? Click here to reset