<-prev [Thread] next-> <-prev [Date] next->
Month Index | List Home

RE: [xsl] [slightly OT]Universal Turing machine in XSLT

Subject: RE: [xsl] [slightly OT]Universal Turing machine in XSLT
From: "Jerry Kimmel" <jkimmel@xxxxxxxxxx>
Date: Fri, 27 Aug 2004 12:56:02 -0400
See this:
A Turing machine has an infinite tape that consists of adjacent cells
(or squares). On each cell is written a symbol. The symbols that are
allowed on the tape are finite in number and include the blank symbol.
Each Turing machine has it's own alphabet (i.e., finite set of symbols),
which determines the symbols that are allowed on the tape.
Current Thread
<- PreviousIndexNext ->
Re: [xsl] [slightly OT]Universal Tu, David Carlisle Thread [xsl] xsl:copy, mode and source cod, Dave Jarvis
Re: [xsl] [slightly OT]Universal Tu, David Carlisle Date [xsl] xsl:copy, mode and source cod, Dave Jarvis
Month