1/18
A set of vocabulary flashcards based on lecture notes regarding the history of algorithms, properties of algorithms, Turing machines, and flowchart symbols.
Name | Mastery | Learn | Test | Matching | Spaced | Call with Kai |
|---|
No analytics yet
Send a link to your students to track their progress
Dixit algorizmi
A phrase meaning "Al-Khwarizmi has said."
Al-Khwarizmi
The scholar who lived in the 9th century and wrote the book "Al-jabr w-al muqabala."
20th Century
The time period when the theory of algorithms emerged as a formal science.
Matiyasevich
The individual who worked on and solved Hilbert's 10th problem.
Determinacy (Муайянӣ)
A property of an algorithm where every step is clearly and uniquely defined.
Finiteness (Охирнокӣ)
A property of an algorithm stating it must conclude after a specific number of steps.
Effectiveness (Натиҷанокӣ)
A property of an algorithm implying it must produce a result for the given problem.
Discreteness (Дискретӣ)
A property of an algorithm where the execution process is divided into separate, distinct steps.
Generality (Оммавият)
A property of an algorithm that allows it to solve a whole class or category of problems.
Elementary Functions in Algorithm Theory
A group of basic functions that includes the successor function (функсияи нишондиҳандагӣ), constant function (функсияи доимӣ), and selection function (функсияи интихоб).
Algorithm Representation Types
There are 3 primary types of ways to represent an algorithm.
Rhombus
The geometric figure used in flowcharts to represent a conditional or decision block.
Ellipse
The geometric figure used at the beginning and the end of an algorithm's flowchart.
De Morgan's Law
A law stating that the negation of the union of N sets is equal to the intersection of the negations of those sets.
Turing Machine Command (AtRqk)
A specific triple used as a command structure within the Turing Machine.
Partial Recursive Function
According to Turing’s view, any such function is correctly computable.
Algorithm Theory Core Concept
The fundamental concept of this theory is the algorithm itself.
Circle (Давра)
The geometric figure used in flowcharts to transition from one part of an algorithm to another.
Post Machine Termination
In a Post machine, the process ends with a result when it receives the "Stop" command.