MICHIGAN ALGORITHM DECODER

  

Copyright © Philip M. Parker, INSEAD. Terms of Use.

MICHIGAN ALGORITHM DECODER

Specialty Definition: MICHIGAN ALGORITHM DECODER

DomainDefinition

Computing

Michigan Algorithm Decoder (MAD) An early programming language, based on IAL, developed at the University of Michigan by R. Graham, Bruce Arden, and Bernard Galler in 1959. MAD ran on the IBM 704, IBM 709, and IBM 7090, and was later ported to Philco, Univac and CDC computers. It was one of the first extensible languages: the user could define his own operators and data types. Mad/1 was a later version. ["Michigan Algorithm Decoder (The MAD Manual)", U Michigan Computing Center, 1966]. [Sammet 1969, p. 205]. (1999-12-10). Source: The Free On-line Dictionary of Computing.

Source: compiled by the editor from various references; see credits.

Top     

Crosswords: MICHIGAN ALGORITHM DECODER

Specialty definitions using "MICHIGAN ALGORITHM DECODER": ALGOL 58for values of. (references)

Top     

Alternative Orthography: MICHIGAN ALGORITHM DECODER


Hexadecimal (or equivalents, 770AD-1900s) (references)

4D 49 43 48 49 47 41 4E      41 4C 47 4F 52 49 54 48 4D      44 45 43 4F 44 45 52

Leonardo da Vinci (1452-1519; backwards) (references)

        

Binary Code (1918-1938, probably earlier) (references)

01001101 01001001 01000011 01001000 01001001 01000111 01000001 01001110 00100000 01000001 01001100 01000111 01001111 01010010 01001001 01010100 01001000 01001101 00100000 01000100 01000101 01000011 01001111 01000100 01000101 01010010

HTML Code (1990) (references)

&#77 &#73 &#67 &#72 &#73 &#71 &#65 &#78 &#32 &#65 &#76 &#71 &#79 &#82 &#73 &#84 &#72 &#77 &#32 &#68 &#69 &#67 &#79 &#68 &#69 &#82

ISO 10646 (1991-1993) (references)

004D 0049 0043 0048 0049 0047 0041 004E      0041 004C 0047 004F 0052 0049 0054 0048 004D      0044 0045 0043 004F 0044 0045 0052

Encryption (beginner's substitution cypher): (references)

47433742434135482354641495243544247238393749383952

Top     



INDEX

1. Crosswords
2. Orthography
3. Bibliography


  

Copyright © Philip M. Parker, INSEAD. Terms of Use.