Return-Path: <John.Harrison-request@cl.cam.ac.uk>
Delivery-Date: 
Received: from leopard.cs.byu.edu (no rfc931) by swan.cl.cam.ac.uk 
          with SMTP (PP-6.5) outside ac.uk; Wed, 17 May 1995 11:41:37 +0100
Received: by leopard.cs.byu.edu (1.37.109.15/16.2) id AA238696366;
          Wed, 17 May 1995 04:26:06 -0600
Sender: info-hol-request@lal.cs.byu.edu
Errors-To: info-hol-request@lal.cs.byu.edu
Precedence: list
Received: from vanuata.dcs.gla.ac.uk by leopard.cs.byu.edu 
          with ESMTP (1.37.109.15/16.2) id AA238196187;
          Wed, 17 May 1995 04:23:07 -0600
Received: from gozo.dcs.gla.ac.uk by vanuata.dcs.gla.ac.uk with LOCAL SMTP (PP);
          Wed, 17 May 1995 10:27:58 +0100
To: "William M. Farmer" <farmer@linus.mitre.org>
Cc: info-hol@leopard.cs.byu.edu, tfm@dcs.gla.ac.uk
Subject: Re: Sequences
In-Reply-To: Your message of "Tue, 16 May 1995 14:05:32 EDT." <199505161805.OAA18758@apollonius.mitre.org>
Date: Wed, 17 May 1995 10:27:48 +0100
From: Tom Melham <tfm@dcs.gla.ac.uk>
Message-ID: <"swan.cl.cam.:186370:950517104354"@cl.cam.ac.uk>

We've had several usable _representations_ of sequences
described here.  More important, however, is the collection
of properties that you use to characterize these sequences.
So, can anyone exhibit a nice abstract characterization 
of infinite+finite sequences?  As usual, we want the
characterizing theorems to be:

  * abstract (doesn't explicitly refer to the representation)
  * independent
  * complete

Tom