- proper subtraction
- мат. собственное вычитание
Большой англо-русский и русско-английский словарь. 2001.
Большой англо-русский и русско-английский словарь. 2001.
Register machine — In mathematical logic and theoretical computer science a register machine is a generic class of abstract machines used in a manner similar to a Turing machine. All the models are Turing equivalent. Contents 1 Overview 2 Formal definition 3 … Wikipedia
Algorithm characterizations — The word algorithm does not have a generally accepted definition. Researchers are actively working in formalizing this term. This article will present some of the characterizations of the notion of algorithm in more detail. This article is a… … Wikipedia
Turing machine — For the test of artificial intelligence, see Turing test. For the instrumental rock band, see Turing Machine (band). Turing machine(s) Machina Universal Turing machine Alternating Turing machine Quantum Turing machine Read only Turing machine… … Wikipedia
Primitive recursive function — The primitive recursive functions are defined using primitive recursion and composition as central operations and are a strict subset of the recursive functions (recursive functions are also known as computable functions). The term was coined by… … Wikipedia
Counter machine models — This page supplements counter machine. Although some authors use the name register machine synonymously with counter machine , this article will give details and examples of only of the most primitive species the counter machine of the genus… … Wikipedia
Universal Turing machine — This article is a supplement to the article Turing machine. Alan Turing s universal computing machine (alternately universal machine , machine U , U ) is the name given by him (1936 1937) to his model of an all purpose a machine (computing… … Wikipedia
μ operator — In computability theory, the μ operator, minimization operator, or unbounded search operator searches for the least natural number with a given property. Contents 1 Definition 2 Properties 3 Examples … Wikipedia
Object theory — For the concept of objects in philosophy, see Object (philosophy). Object theory is a theory in philosophy and mathematical logic concerning objects and the statements that can be made about objects. Contents 1 An informal theory 2 Objects 3 A… … Wikipedia
László Kalmár — (March 271905 August 21976) was a Hungarian mathematician and Professor at the University of Szeged. Kalmár is considered the founder of mathematical logic and theoretical Computer Science in Hungary. His early life mixed promise and tragedy. His … Wikipedia
Dependency network — Contents 1 Importance 2 Overview 3 The activity dependency networks … Wikipedia
Wikipedia:Manual of Style/Dates and numbers — Shortcuts: WP:MOSNUM WP:DATE MOS:NUM This page is part of the Ma … Wikipedia