* Argument ( computer science ), a piece of data provided as input to a subroutine

In mathematics and computer science, an algorithm ( originating from al-Khwārizmī, the famous Persian mathematician Muḥammad ibn Mūsā al-Khwārizmī ) is a step-by-step procedure for calculations.

* Program analysis ( computer science ) – the process of automatically analyzing the behavior of computer programs

* Semantic analysis ( computer science ) – a pass by a compiler that adds semantical information to the parse tree and performs certain checks

* Atomic operation, in computer science

He was highly influential in the development of computer science, giving a formalisation of the concepts of " algorithm " and " computation " with the Turing machine, which can be considered a model of a general purpose computer.

Turing is widely considered to be the father of computer science and artificial intelligence.

Babbage understood that the existence of an automatic computer would kindle interest in the field now known as algorithmic efficiency, writing in his Passages from the Life of a Philosopher, " As soon as an Analytical Engine exists, it will necessarily guide the future course of the science.

In algorithmic information theory ( a subfield of computer science ), the Kolmogorov complexity of an object, such as a piece of text, is a measure of the computational resources needed to specify the object.

Algorithmic information theory is the area of computer science that studies Kolmogorov complexity and other complexity measures on strings ( or other data structures ).

In computer science, an array data structure or simply an array is a data structure consisting of a collection of elements ( values or variables ), each identified by at least one array index or key.

The term is also used, especially in the description of algorithms, to mean associative array or " abstract array ", a theoretical computer science model ( an abstract data type or ADT ) intended to capture the essential properties of arrays.

In computer science, an AVL tree is a self-balancing binary search tree, and it was the first such data structure to be invented.

Category: 1962 in computer science

In computer science, the analysis of algorithms is the determination of the number of resources ( such as time and storage ) necessary to execute them.

Run-time efficiency is a topic of great interest in computer science: A program can take seconds, hours or even years to finish executing, depending on which algorithm it implements ( see also performance analysis, which is the analysis of an algorithm's run-time in practice ).

In computer science, an abstract data type ( ADT ) is a mathematical model for a certain class of data structures that have similar behavior ; or for certain data types of one or more programming languages that have similar semantics.

This cutting-edge technology has a promising potential of leading a new revolution in science as integrated circuits did in computer developments.

* Alternating Turing machine, model of computation used in theoretical computer science

* Program analysis ( computer science )

* Artificial intelligence, a branch of computer science.

* List of open problems in computer science

In a category with exponentials, using the isomorphism ( in computer science, this is called currying ), the Ackermann function may be defined via primitive recursion over higher-order functionals as follows:

The abacus shows how numbers, letters, and signs can be stored in a binary system on a computer, or via ASCII.

The first programmable computer built by Konrad Zuse used binary notation for numbers.

The software and computer industries often use binary approximations of the SI-prefixed quantities, while producers of computer storage devices prefer the SI values.

* Executable, a type of binary file that contains machine code for the computer to execute

Sometimes, especially in computer science, the term is used for any binary function.

By the mid 1960s, binary addressing had become the standard architecture in most computer designs, and main memory sizes were most commonly powers of two.

Bootstrapping in program development began during the 1950s when each program was constructed on paper in decimal code or in binary code, bit by bit ( 1s and 0s ), because there was no high-level computer language, no compiler, no assembler, and no linker.

A tiny assembler program was hand-coded for a new computer ( for example the IBM 650 ) which converted a few instructions into binary or decimal code: A1.

In computer science, a binary search or half-interval search algorithm finds the position of a specified value ( the input " key ") within a sorted array.

A modern digital computer represents data using the binary numeral system.

A piece of information can be handled by any computer or device whose storage space is large enough to accommodate the binary representation of the piece of information, or simply data.

A machine language consists of groups of binary values signifying processor instructions that change the state of the computer from its preceding state.

Underlying computer programming concepts like quicksort, hashtable, array, and binary tree can be useful to creating software.

A compiler is a computer program ( or set of programs ) that transforms source code written in a programming language ( the source language ) into another computer language ( the target language, often having a binary form known as object code ).

* Cartesian tree, a binary tree in computer science

In the 1970s and early 1980s, the software industry began using technical measures ( such as only distributing binary copies of computer programs ) to prevent computer users from being able to study and modify software.

On a typical computer system, a ' double precision ' ( 64-bit ) binary floating-point number has a coefficient of 53 bits ( one of which is implied ), an exponent of 11 bits, and one sign bit.

In 1938, Konrad Zuse of Berlin completed the Z1, the first mechanical binary programmable computer, this was however unreliable in operation.

Konrad Zuse, architect of the first programmable computer, which used 22-bit binary floating point.

The IEEE has standardized the computer representation for binary floating-point numbers in IEEE 754 ( aka.