I'd suggest that you read David Marr's "Vision" and the part "1.2
Understanding Complex Information-Processing Systems".
I think that's the perfect introduction to terms like "Formal Scheme",
"Formal System", "Computational Theory", "Algorithm", etc. and how
they all fit together.
In Marr's opinion, perhaps. It takes more than one reference to
demonstrate a consensus.
The definition I proposed agrees with Cohen, _Introduction to
Computer Theory_; Knuth, TAOCP 1 (it's even the definition given in
the index entry for "language"); Gersting, _Mathematical Structures
for Computer Science_; Aho, Sethi, Ullman, _Compilers_ (the "Dragon
book"); Holub, _Compiler Design in C_. Those are just references I
happen to have handy.
Now please explain why I should believe your definition, and Marr's
(assuming his actually agrees with you), over all of those. And
please demonstrate that there's any consensus among computing theory
practitioners that your definition is superior.
I shall glance over the fact that you try to cast doubts over my
command of the English language.
You misread. I was merely noting that terms of art in a field may
differ according to the language in which they're expressed.
I have little evidence from which to draw conclusions about your
grasp of English. Nor do I care, particularly.
I didn't invent the terms, nor their definitions. I wish I would
I never said you did. You're inventing your own *terminology* (not
terms) by insisting on distinctions which are not generally
recognized by practitioners in the field.
But thanks for playing, and better luck next time, eh?
--
Michael Wojcik (e-mail address removed)
This is a "rubbering action game," a 2D platformer where you control a
girl equipped with an elastic rope with a fishing hook at the end.
-- review of _Umihara Kawase Shun_ for the Sony Playstation