[FRIAM] More on levels of sequence organization

[Frank Wimberly]

                                          Turing Award

Pradesh, India
EDUCATION:

B.S., Civil Engineering, Guindy College of Engineering, Madras, (Now Anna
University, Chennai), India, 1958; MTech, University of New South Wales,
Sydney, Australia, 1960; PhD Stanford University, 1966.
EXPERIENCE:

Applied Science Representative, IBM (Australia), Sydney, Australia, 1960 –
1963; Assistant Professor of Computer Science, Stanford University 1966 –
1969; Associate Professor Computer Science, Carnegie Mellon University 1969
– 1973; Professor of Computer Science, Carnegie Mellon University 1973 –
1984; University Professor of Computer Science, Carnegie Mellon University;
1984 – present; Founding Director, Robotics Institute, Carnegie Mellon
University; 1980 – 1992; Dean, School of Computer Science, Carnegie Mellon
University, 1991 – 1999; Herbert A. Simon University Professor of Computer
Science and Robotics, Carnegie Mellon University, 1992 – 2005; Founding
Director, Carnegie Mellon University West Coast Campus, Mountain View,
California; 2001 – 2004; Mozah Bint Nasser University Professor of Computer
Science and Robotics, Carnegie Mellon University, 2005 – present
HONORS AND AWARDS:

Fellow, Acoustical Society of America; Fellow, Institute of Electrical and
Electronics Engineers, Inc. (IEEE); Founding Fellow of the American
Association for Artificial Intelligence (now called the Association for the
Advancement of Artificial Intelligence, AAAI); Foreign Member, Chinese
Academy of Engineering; Foreign Fellow, Indian National Science Academy
(INSA); Foreign Fellow, Indian National Academy of Engineering(INAE);
Recipient, Legion d’Honneur, presented by President Mitterrand of France
(1984); Member of the National Academy of Engineering (1984); President,
American Association for Artificial Intelligence (now called the
Association for the Advancement of Artificial Intelligence, AAAI)
(1987-1989); IBM Research Ralph Gomory Visiting Scholar Award (1991);
Co-Recipient, Association for Computing Machinery Turing Award (jointly
with Ed Feigenbaum) (1994); Member of the American Academy of Arts and
Sciences (1995); Recipient, Padma Bhushan Award, presented by President of
India (2001); Okawa Prize (2004); Honda Prize (2005); IJCAI Donald E.
Walker Distinguished Service Award (2005); Vannevar Bush Award (2006); The
IEEE James L. Flanagan Speech and Audio Processing Award (2008); inducted
into IEEE Intelligent Systems' AI's Hall of Fame for the "significant
contributions to the field of AI and intelligent systems" (2011).

Honorary Doctorates: Sri Venkateswara University, Henri Poincaré
University, University of New South Wales, Jawaharlal Nehru Technology
University, University of Massachusetts, University of Warwick, Anna
University, Indian Institute for Information Technology (Allahabad), Andhra
University, IIT Kharagpur, and Hong Kong University of Science and
Technology
*Raj Reddy pioneered the construction of systems for recognizing continuous
speech.*He developed the first system, *Hearsay I*, capable of continuous
speech recognition. In this system and subseq

On Sat, May 4, 2019, 6:51 PM Russell Standish <lists at hpcoders.com.au> wrote:

> On Sat, May 04, 2019 at 05:25:54PM -0700, glen∈ℂ wrote:
> > Right. But that's the point, I think. To what extent are semantics
> invariant across these supposed "levels"? My argument is that "levels" are
> figments of our imagination. The best we can say is that iteration
> constructs something that we find convenient to name: "level". But what
> reality is actually doing is mere aggregation and the meanings of the
> primitives are no different from the meanings of the aggregates.
>
>
> I don't think levels are just figments of imagination. Compression
> algorithms replace explicit descriptions with generative algorithms
> (like procedures of functions) that when called with appropriate
> parameters reproduce the original data. These generative descriptions
> have a tree-like structure, which is exactly the heirarchical
> structure you're after.
>
> Obviously, there is no unique compression algorithm, nor even a unique
> best algorithm. But I suspect that the best compression algorithms will
> probably
> agree up to an isomorphism on the heirarchical structure for most
> compressible data sets (note that this is already a set of measure
> zero in the space of all data sets :). I don't have any data for my
> hunch, though.
>
>
> --
>
>
> ----------------------------------------------------------------------------
> Dr Russell Standish                    Phone 0425 253119 (mobile)
> Principal, High Performance Coders
> Visiting Senior Research Fellow        hpcoder at hpcoders.com.au
> Economics, Kingston University         http://www.hpcoders.com.au
>
> ----------------------------------------------------------------------------
>
> ============================================================
> FRIAM Applied Complexity Group listserv
> Meets Fridays 9a-11:30 at cafe at St. John's College
> to unsubscribe http://redfish.com/mailman/listinfo/friam_redfish.com
> archives back to 2003: http://friam.471366.n2.nabble.com/
> FRIAM-COMIC <http://friam.471366.n2.nabble.com/FRIAM-COMIC>
> http://friam-comic.blogspot.com/ by Dr. Strangelove
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://redfish.com/pipermail/friam_redfish.com/attachments/20190504/1a5d8f6c/attachment.html>