Automaton (tradition)

Across the cited traditions automata are presented as crafted creations of skilled makers rather than independent supernatural beings. Greek myth locates automata in the workshops of divine smiths (e.g., Hephaestus) and legendary engineers (e.g., Daedalus) and produces named examples such as Talos. Chinese court literature (the Lie Zi account) records the artificer Yan Shi presenting a life‑size mechanical human to King Mu. Hellenistic engineers in Alexandria (Hero, Ktesibios) developed hydraulics and pneumatics to produce moving birds, whistles and clock jacks. These accounts consistently frame automata as engineered demonstrations of craft and technical knowledge.

Appearances vary by example: many automata were fashioned to resemble humans or animals. Legendary examples include Talos, described as a bronze man; presumed humanoid attendants in Hephaestus' workshop; and Yan Shi's life‑size figure, externally lifelike (coloured white, black, red and blue) and internally composed of artificial organs, muscles, bones, joints, skin, teeth and hair. Hellenistic devices could be small animal models, water‑driven birds or figures mounted on public clocks (jacks and cuckoo figures). Materials named in the sources include bronze, wood, leather, glue and lacquer in different traditions.

Automata operate by concealed mechanisms, hydraulics, pneumatics, weights or prearranged controls to follow sequences of motion or respond to inputs. In traditional narratives they walk, move heads, sing or posture in time; Hero and Ktesibios used water and air to animate whistles and model birds, and public clock figures performed timed movements. The Lie Zi account stresses contingency on mechanical components: removing the artificial 'heart' silenced the mouth, removing the 'liver' extinguished the eyes' function, and taking away the 'kidneys' stopped locomotion, illustrating that behaviour depended on constructed parts rather than an animating soul. In modern technical contexts the related sense of 'automaton' denotes formal computational models (finite automata, pushdown automata, cellular automata) that process inputs according to fixed transition rules.