News for hackers. Stuff that matters.
Re:What is the enlightenment I'm supposed to attain after st... by dbaupp on Monday December 24, 2012 @02:23AM (#4962168)
It sounds a bit like you are talking about a Turing machine rather than a finite automaton (the latter is much weaker than the former in computational power).

(Not that it matters much, your point still stands.)

Re:What is the enlightenment I'm supposed to attain after st... by marcosdumay on Monday December 24, 2012 @10:46AM (#4963124)
They are equivalent. None of them is weaker. And, by the way, your PC (Von Neuman architecture) is an example of finite automatum.

I've seen the FA formalism used in computing theory a few times. Yet, I'm also missing whatever enlightment the author is looking for. But, if for no other reason, it's worth learning just because it's a very nice tool.

Re:What is the enlightenment I'm supposed to attain after st... by robrenaud on Monday December 24, 2012 @10:59AM (#4963167)
Read the theory again. Finite automata are quite weak.
Re:What is the enlightenment I'm supposed to attain after st... by aaronblohowiak on Monday December 24, 2012 @12:11PM (#4963412)
Where is the infinite tape? Finite automata are as capable, in the real world, as Turing-like machines, because it is impossible to fabricate a machine with infinite storage.
Re:What is the enlightenment I'm supposed to attain after st... by jacquesm on Monday December 24, 2012 @04:49PM (#4964223)
Turing machines have infinite storage by definition, no such machine has ever been built (we're using approximations), real world restrictions do not apply to imaginary constructs.

If a Turing machine were not defined that way then you'd have to set some upper limit to the size of the tape and that in turn would have odd implications for what would be considered 'computable'. By making the tape infinite by definition you get much more meaningful answers about what is in principle computable and what is not.

Re:What is the enlightenment I'm supposed to attain after st... by mturmon on Monday December 24, 2012 @09:33PM (#4964875)
Indeed, we have done everything we can to provide ways to keep the illusion of running on a Turing machine going -- I'm thinking about mmap(), swapping to disk, tape robots, and databases, among others.

Yes, Virginia, you can always obtain more memory.

Re:What is the enlightenment I'm supposed to attain after st... by ncallaway on Monday December 24, 2012 @01:07PM (#4963573)
robrenaud did not respond to the argument that the PC is a Finite Automata.

His only comment was that "Finite Automata are quite weak" (in the context of the _theoretical difference_ between Turing machines and FA). He's absolutely correct. FA can compute a strict subset of what Turing machines can compute.

Re:What is the enlightenment I'm supposed to attain after st... by upquark on Monday December 24, 2012 @12:12PM (#4963415)
This is factually incorrect.