recursive theor
Смотреть что такое "recursive theor" в других словарях:
Denotational semantics — In computer science, denotational semantics (initially known as mathematical semantics or Scott–Strachey semantics) is an approach to formalizing the meanings of programming languages by constructing mathematical objects (called denotations)… … Wikipedia
Сверхтьюринговые вычисления — Сверхтьюринговыми вычислениями (или гипервычислениями (англ. hypercomputation)) называются такие вычисления, которые не могут быть проделаны на машине Тьюринга. Они включают в себя разнообразные гипотетические методы, основанные на… … Википедия
Hypercomputation — refers to various hypothetical methods for the computation of non Turing computable functions (see also supertask). The term was first introduced in 1999 by Jack Copeland and Diane Proudfoot [Copeland and Proudfoot,… … Wikipedia
Denotational semantics of the Actor model — The denotational semantics of the Actor model is the subject of denotational domain theory for Actors. The historical development of this subject is recounted in [Hewitt 2008b]. Contents 1 Actor fixed point semantics 2 Compositionality in… … Wikipedia
Francisco Antônio Dória — Francisco Antônio de Moraes Accioli Dória (born 1945, Rio de Janeiro, Brazil) is a Brazilian mathematician, philosopher, and noted genealogist. Francisco Antônio Dória received his B.S. in Chemical Engineering from the Federal University at Rio… … Wikipedia
Марелье, Карл Йохан — Карл Йохан Марелье (фр. C. Johan Masreliez; 15 апреля 1939(19390415) в Стокгольме) физик теоретик, инженер и изобретатель, гражданин США, проживает около Сиэттла. На протяжении 1970 −80 годов он внес важный вклад в развитие электронных… … Википедия
Butcher group — In mathematics, the Butcher group, named after the New Zealand mathematician John C. Butcher by Hairer Wanner (1974), is an infinite dimensional group first introduced in numerical analysis to study solutions of non linear ordinary differential… … Wikipedia
Post correspondence problem — The Post correspondence problem is an undecidable decision problem that was introduced by Emil Post in 1946.[1] Because it is simpler than the halting problem and the Entscheidungsproblem it is often used in proofs of undecidability. Contents 1… … Wikipedia
Tutte polynomial — This article is about the Tutte polynomial of a graph. For the Tutte polynomial of a matroid, see Matroid. The polynomial x4 + x3 + x2y is the Tutte polynomial of the Bull graph. The red line shows the intersection with the plane … Wikipedia
Genetic code — A series of codons in part of a messenger RNA (mRNA) molecule. Each codon consists of three nucleotides, usually representing a single amino acid. The nucleotides are abbreviated with the letters A, U, G and C. This is mRNA, which uses U (uracil) … Wikipedia
Hypercalcul — Demande de traduction Hypercomputation → … Wikipédia en Français
