Re: Can we agree on what a machine is?

Ricardo Ribeiro Gudwin (gudwin@DCA.FEE.UNICAMP.BR)
Mon, 1 Feb 1999 10:06:51 -0200


Don Mikulecky wrote:

> With the Turing machine we get into the infinite tape problem...it is NOT
> realizable!
> Don

Hmmm, .... , but if you restrict yourself to any finite set of problems, than
you
can put a size on this tape, can't you ? Or there should be single problems that
do
demand infinite tapes ?
Ricardo

--
                                                   //\\\
                                                   (o o)
 +-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-oOO--(_)--OOo-=-=-+
 \                   Prof. Ricardo Ribeiro Gudwin                /
 /             Intelligent Systems Development Group             \
 \    DCA - FEEC - UNICAMP    |           INTERNET               /
 /     Caixa Postal 6101      |     gudwin@dca.fee.unicamp.br    \
 \   13081-970 Campinas, SP   |       gudwin@fee.unicamp.br      /
 /          BRAZIL            |      gudwin@correionet.com.br    \
 +-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-+
 \ URL:        http://www.dca.fee.unicamp.br/~gudwin/            /
 / Telephones: +55 (19) 788-3819 DCA/Unicamp (University)        \
 \             +55 (19) 254-0184 Residencia  (Home)              /
 / FAX:        +55 (19) 289-1395                                 \
 +-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-+