Gene <gene.ress...@gmail.com> writes: > The FA or TM dichotomy is more painful to contemplate than you say. > Making appropriate simplifications for input, any modern computer is a > FA with 2^(a few trillion) states. Consequently, the gestalt of > computer science seems to be to take it on faith that at some very > large number of states, the FA behavior makes a transition to TM > behavior for all possible practical purposes (and I mean all). So > what is it--really--that's trivial to analyze? And what is > impossible? I'm sorry this is drifting OT and will stop here.
Don't worry, this thread is becoming interesting at least. -- __Pascal Bourguignon__ http://www.informatimago.com/ -- http://mail.python.org/mailman/listinfo/python-list
