On Jul 14, 8:06*pm, Bob Badour <bbad... (AT) pei (DOT) sympatico.ca> wrote:
Complexity is measured by a potential number of bugs. By that criteria
TM simulator, e.g.

http://math.ucsd.edu/~sbuss/CourseWe...NobleJava.html

is both complex and fugly.

The underlying TM concepts ("tape", "read/write", "instruction")
appeal to human intuition, but are by no means clean mathematical
entities. I noticed my elevated confidence when programming heavily
mathematical stuff: the code essentially writes itself and the the
bugs are few and between.

Bob Badour <bbadour (AT) pei (DOT) sympatico.ca> wrote:

[snip]

No. I was discussing Turing machines.

Sincerely,

Gene Wirchenko

Computerese Irregular Verb Conjugation:
I have preferences.
You have biases.
He/She has prejudices.

Gene Wirchenko wrote:

True, but that's not all you were discussing. You were also discussing
prettiness and elegance. The lambda calculus accomplishes the same as
the turing machine only with more beauty and elegance.

I recommend you search the EWD archive for what Dijkstra has to say
about elegance.