The class of Boolean Algebras are a subset of the class of Turing Machines?

From: Stephen Paul King <stephenk1.domain.name.hidden>
Date: Tue, 26 Nov 2002 12:29:21 -0500

Dear Ben,

    So you are writing that the class of Boolean Algebras are a subset of
the class of Turing Machines?

Kindest regards,

Stephen

----- Original Message -----
From: "Ben Goertzel" <ben.domain.name.hidden>
To: "Stephen Paul King" <stephenk1.domain.name.hidden>;
<everything-list.domain.name.hidden>
Sent: Tuesday, November 26, 2002 9:58 AM
Subject: RE: turing machines = boolean algebras ?


>
> Essentially, you can consider a classic Turing machine to consist of a
> data/input/output tape, and a program consisting of
>
> -- elementary tape operations
> -- boolean operations
>
> I.e. a Turing machine program is a tape plus a program expressed in a
> Boolean algebra that includes some tape-control primitives.
>
> -- Ben G
>
>
> > -----Original Message-----
> > From: Stephen Paul King [mailto:stephenk1.domain.name.hidden]
> > Sent: Tuesday, November 26, 2002 9:25 AM
> > To: everything-list.domain.name.hidden
> > Subject: Re: turing machines = boolean algebras ?
> >
> >
> > Dear Ben and Bruno,
> >
> > Your discussions are fascinating! I have one related and pehaps even
> > trivial question: What is the relationship between the class of Turing
> > Machines and the class of Boolean Algebras? Is one a subset of the
other?
> >
> > Kindest regards,
> >
> > Stephen
> >
> >
>
>
Received on Tue Nov 26 2002 - 12:31:09 PST