HANS BERNHARD, text
genetics , binary; sequences
binary sequences
comment:
core logic, machine math, machine
code, assembly code. Some kind of "core logic" (a minimal logical
apparatus) is inevitable,
for implementations, just as machine code can't be avoided if you want
to run algorithms. Machine Math MUST
be a formal language, with a precise syntax and semantics. However,
it must be UNLIKE currently known formal languages in that it must
NOT be repulsive to mathematicians. This must be accomplished by
making the syntax of Machine Math sufficiently similar to what
mathematicians currently write in journals.
Programming Language -> Compiler -> Machine Language
A compiler performs 2 tasks:
1. analysis of the source program
2. synthesis of a machine-language equivalent of the source program
A machine will offer a few sizes (8, 16, 32 bits), which one(s) do we allow or use?
character sets
ASCII, EBCDIC, ISO 8859 (Latin-1), UNICODE
preprocessors
* eqn for equations
* tbl for tables
* pic for pictures
* cpp the C preprocessor
text formatting
* LaTeX source -> latex -> DVI (DeVice Independent) file
* (g/n/t)roff source -> (g/n/t)roff -> ascii/postscript/dvi file
converters
* dvips - convert a TeX DVI file to PostScript
* grodvi - convert groff output to TeX dvi format
* htmltotex - convert html file to TeX format
* a2ps - ascii to PostScript
source: mario merz, neon, fibonacci [museum fuer gegenwartskunst, basel / switzerland]
copyright 2002 HANS BERNHARD