Information Technology and Algorithm Theory Flashcards

0.0(0)
Studied by 0 people
call kaiCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/18

flashcard set

Earn XP

Description and Tags

A set of vocabulary flashcards based on lecture notes regarding the history of algorithms, properties of algorithms, Turing machines, and flowchart symbols.

Last updated 4:22 PM on 6/14/26
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai

No analytics yet

Send a link to your students to track their progress

19 Terms

1
New cards

Dixit algorizmi

A phrase meaning "Al-Khwarizmi has said."

2
New cards

Al-Khwarizmi

The scholar who lived in the 9th9^{th} century and wrote the book "Al-jabr w-al muqabala."

3
New cards

20th20^{th} Century

The time period when the theory of algorithms emerged as a formal science.

4
New cards

Matiyasevich

The individual who worked on and solved Hilbert's 10th10^{th} problem.

5
New cards

Determinacy (Муайянӣ)

A property of an algorithm where every step is clearly and uniquely defined.

6
New cards

Finiteness (Охирнокӣ)

A property of an algorithm stating it must conclude after a specific number of steps.

7
New cards

Effectiveness (Натиҷанокӣ)

A property of an algorithm implying it must produce a result for the given problem.

8
New cards

Discreteness (Дискретӣ)

A property of an algorithm where the execution process is divided into separate, distinct steps.

9
New cards

Generality (Оммавият)

A property of an algorithm that allows it to solve a whole class or category of problems.

10
New cards

Elementary Functions in Algorithm Theory

A group of basic functions that includes the successor function (функсияи нишондиҳандагӣ), constant function (функсияи доимӣ), and selection function (функсияи интихоб).

11
New cards

Algorithm Representation Types

There are 33 primary types of ways to represent an algorithm.

12
New cards

Rhombus

The geometric figure used in flowcharts to represent a conditional or decision block.

13
New cards

Ellipse

The geometric figure used at the beginning and the end of an algorithm's flowchart.

14
New cards

De Morgan's Law

A law stating that the negation of the union of NN sets is equal to the intersection of the negations of those sets.

15
New cards

Turing Machine Command (AtRqkAt R q_k)

A specific triple used as a command structure within the Turing Machine.

16
New cards

Partial Recursive Function

According to Turing’s view, any such function is correctly computable.

17
New cards

Algorithm Theory Core Concept

The fundamental concept of this theory is the algorithm itself.

18
New cards

Circle (Давра)

The geometric figure used in flowcharts to transition from one part of an algorithm to another.

19
New cards

Post Machine Termination

In a Post machine, the process ends with a result when it receives the "Stop" command.