* 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:

Notice of closure attached to the door of a computer store the day after its parent company declared " bankruptcy " ( strictly, put into administration — see text ) in the United Kingdom.

In mathematical logic and computer science, the Kleene star ( or Kleene operator or Kleene closure ) is a unary operation, either on sets of strings or on sets of symbols or characters.

* In computer science, the asterisk is used in regular expressions to denote zero or more repetitions of a pattern ; this use is also known as the Kleene star or Kleene closure after Stephen Kleene.

By 2000, the improved performance of Direct3D and OpenGL on the average personal computer, coupled with the huge variety of new 3D cards on the market, the widespread support of these standard APIs by the game developer community and the closure of 3dfx, would make Glide obsolete.

In computer science, the Floyd – Warshall algorithm ( also known as Floyd's algorithm, Roy – Warshall algorithm, Roy – Floyd algorithm, or the WFI algorithm ) is a graph analysis algorithm for finding shortest paths in a weighted graph ( with positive or negative edge weights ) and also for finding transitive closure of a relation R. A single execution of the algorithm will find the lengths ( summed weights ) of the shortest paths between all pairs of vertices, though it does not return details of the paths themselves.

* General Purpose Interface, Standard contact closure format used in broadcast level post production equipment, allowing computer based editing equipment to synchronously " start " at the same time.

* Normal closure ( disambiguation ) in group theory and as a command in computer algebra systems

In 2005, a general decline in gaming and computer magazine readership led to the closure of its publishers, Live Publishing, although the rights to the magazine were later purchased by Imagine Publishing.

Several websites allow anyone with computer access to make one to protest any cause, such as stopping construction or closure of a store.

Lambda lifting or closure conversion is the process of eliminating free variables from local function definitions from a computer program.

* initiating an interval timer in said computer upon the closure of the press for monitoring the elapsed time of said closure,

The closure was a part of Disney's shift from traditional hand-drawn animation to computer animation, and it was explained with: "... after reviewing our business plans and production requirements, we determined we no longer can support this additional production capacity.

A location in the computer store is also named for each marked form ; ;

The researchers invited 45 volunteers to play a computer game and also to watch the computer play the game.

In human – computer interaction, computer accessibility ( also known as Accessible computing ) refers to the accessibility of a computer system to all people, regardless of disability or severity of impairment.

** Titan ( computer ), also known as the Atlas 2, its successor

The original Apple Computer, also known retroactively as the Apple I, or Apple-1, is a personal computer released by the Apple Computer Company ( now Apple Inc .) in 1976.

It was also a less expensive alternative to the Apple Macintosh and IBM PC as a general-purpose business or home computer.

There were also many popular games officially converted to the Electron from arcade machines ( including Crystal Castles, Tempest, Commando, Paperboy and Yie Ar Kung-Fu ) or other home computer systems ( including Impossible Mission, Jet Set Willy, The Way of the Exploding Fist, Tetris, The Last Ninja, Barbarian and SimCity ).

A similar solution was the 850 kbit / s DaynaTalk, a separate box which plugged in between the computer and a normal LocalTalk / PhoneNet box, and also offered as a PC expansion card that ran up to 1. 7 Mbit / s.

The Aster computer could use the software written for the popular Tandy TRS-80 computer while fixing many of the problems of that computer, but it could also run CP / M software, with a big amount of free memory ( Transient Program Area, TPA ) and a full 80 × 25 display, and it could be used as a Videotext terminal.

They also sold the exotic Olivetti M20, a very early 16 bit personal computer that was one of the very few systems to use a Z8000 CPU.

Because the original designer had left the company another employee completely redesigned most of the system, ( adding a display snow remover circuit, true 80 / 64 column text mode support, ( with different size letters for TRS-80 and CP / M mode, so that in TRS-80 mode the full screen was also used, not just a 64x16 portion of the 80x25 screen ) with an improved font set ( adding " gray scale " version of the TRS-80 mozaik graphics and many special PETSCII like characters ), and a more flexible and reliable floppy disk controller and keyboard interface plus many other small improvements ), also an enclosure was developed for the main computer system, ( in the form of a 19-inch rack for the Eurocards ) and for two floppy disk drives and the power supply.

After the Aster having been a few years on the Market Tandy released its own improved model, the TRS-80 Model 3 computer which solved many of the same problems that the Aster also had solved, but the model 3 still did not fully support CP / M as the Aster did.

The comparatively low price for a complete computer system with dedicated monitor, its high resolution monochrome text and graphic capabilities and the possibility to run CP / M software also rendered the system attractive for business users, which was reflected by a wide selection of application software.

Amdahl's law, also known as Amdahl's argument, is named after computer architect Gene Amdahl, and is used to find the maximum expected improvement to an overall system when only part of the system is improved.

Automated theorem proving ( also known as ATP or automated deduction ) is the proving of mathematical theorems by a computer program.

With current technology, AI-complete problems cannot be solved by computer alone, but also require human computation.

ACM also sponsors other computer science related events such as the worldwide ACM International Collegiate Programming Contest ( ICPC ), and has sponsored some other events such as the chess match between Garry Kasparov and the IBM Deep Blue computer.