AP Computer Science Chapter 12 Vocabulary

Turing Award

The ACM A.M. Turing Award is an annual prize given by the Association for Computing Machinery to an individual selected for contributions "of lasting and major technical importance to the computer field." innovative!!

Turing machine program

a collection of instructions that allow a Turing Machine to carry out a certain task

Turing machine

a mathematical model of computation that defines an abstract machine, which manipulates symbols on a strip of tape according to a table of rules. You can read, erase, and rewrite.

Uncomputable/unsolvable

a number that is well defined, but cannot be computed by an algorithm

Turing machine instruction

describe the details of the actions that the Turing machine carries out. Given the current tape symbol and the state of the read/write unit, describes the symbol to write, the next state, and the direction of move of the read/write unit.

Proof by contradiction

establishes the truth or validity of a proposition. Assume the opposite of what you want to prove and follow the logical consequences until you reach a contradiction, thereby showing that your assumption is incorrect.

Recognizer

is a machine that recognizes languages. A Turing Machine that s whether the string of characters initially on its tape matches a certain pattern.decides whether the string of characters initially on its tape matches a certain pattern

Unary representation

means that we will use only one symbol, namely 1 ONE SYMBOL ONLY ONE

State diagram

require that the system described is composed of a finite number of states. A visual representation of a Turing machine algorithm. Describes the behavior of a system.

Computability

the ability to solve a problem in an effective manner. It is a key topic of the field of computability theory within mathematical logic and the theory of computation within computer science. The computability of a problem is closely linked to the existence of an algorithm to solve the problem. Capable of being computed through a series of algorithms.

Church Turing Thesis

In computability theory, the Church-Turing thesis is a hypothesis about the nature of computable functions. It states that a function on the natural numbers is computable by a human being following an algorithm, ignoring resource limitations, if and only if it is computable by a Turing machine. make human activities digital

Halting problem

In computability theory, the halting problem is the problem of determining, from a description of an arbitrary computer program and an input, whether the program will finish running or continue to run forever.

Tape alphabet

L(but upside down) a finite set of symbols. The allowable symbols that can be written on a Turing machine tape.