Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

History of the First Robot

Description

This lecture delves into the fascinating history of automatons, from the Babylonian hourglass to Leonardo da Vinci's creations, leading to the emergence of robots in the 20th century inspired by nature's mechanisms.

In MOOC

The Thymio robot as a tool for discovering digital science

Official source

Related concepts (13)

Ω-automaton

In automata theory, a branch of theoretical computer science, an ω-automaton (or stream automaton) is a variation of finite automata that runs on infinite, rather than finite, strings as input. Since ω-automata do not stop, they have a variety of acceptance conditions rather than simply a set of accepting states. ω-automata are useful for specifying behavior of systems that are not expected to terminate, such as hardware, operating systems and control systems.

Pushdown automaton

In the theory of computation, a branch of theoretical computer science, a pushdown automaton (PDA) is a type of automaton that employs a stack. Pushdown automata are used in theories about what can be computed by machines. They are more capable than finite-state machines but less capable than Turing machines (see below). Deterministic pushdown automata can recognize all deterministic context-free languages while nondeterministic ones can recognize all context-free languages, with the former often used in parser design.

Büchi automaton

In computer science and automata theory, a deterministic Büchi automaton is a theoretical machine which either accepts or rejects infinite inputs. Such a machine has a set of states and a transition function, which determines which state the machine should move to from its current state when it reads the next input character. Some states are accepting states and one state is the start state. The machine accepts an input if and only if it will pass through an accepting state infinitely many times as it reads the input.

Automaton

An automaton (ɔːˈtɒmətən; : automata or automatons) is a relatively self-operating machine, or control mechanism designed to automatically follow a sequence of operations, or respond to predetermined instructions. Some automata, such as bellstrikers in mechanical clocks, are designed to give the illusion to the casual observer that they are operating under their own power or will, like a mechanical robot. The term has long been commonly associated with automated puppets that resemble moving humans or animals, built to impress and/or to entertain people.

Nondeterministic finite automaton

In automata theory, a finite-state machine is called a deterministic finite automaton (DFA), if each of its transitions is uniquely determined by its source state and input symbol, and reading an input symbol is required for each state transition. A nondeterministic finite automaton (NFA), or nondeterministic finite-state machine, does not need to obey these restrictions. In particular, every DFA is also an NFA. Sometimes the term NFA is used in a narrower sense, referring to an NFA that is not a DFA, but not in this article.

Related lectures (29)

The History of the First Robot

Delves into the history of robots, from ancient automatons to the first electric robot.

History of the First Robot MOOC: The Thymio robot as a tool for discovering digital science

Explores the history of robots, from automatons to the first practical robot, Electric Dog, showcasing the significance of bio-inspiration in robotics.

Coin Rendering: Part 1 MOOC: Information, Computation, Communication: Introduction to computational thinking

Covers coin rendering and the limitations of the greedy algorithm in finding optimal solutions.

The History of the First Robot MOOC: The Thymio robot as a tool for discovering digital science

Explores the long history of robots, from ancient ancestors to modern bioinspired creations.

Early Modern Technical Drawings