Перевод: с английского на все языки

informal description

См. также в других словарях:

  • Description logic — (DL) is a family of formal knowledge representation languages. It is more expressive than propositional logic but has more efficient decision problems than first order predicate logic. DL is used in artificial intelligence for formal reasoning on …   Wikipedia

  • Description — For other uses, see Description (disambiguation). Description is one of four rhetorical modes (also known as modes of discourse), along with exposition, argumentation, and narration. Each of the rhetorical modes is present in a variety of forms… …   Wikipedia

  • description — I (New American Roget s College Thesaurus) Act of representation Nouns 1. description, account, exposé (see disclosure); specification, particulars; summary (see shortness); guidebook (see information); delineation, representation, sketch,… …   English dictionary for students

  • X logical font description — (XLFD) is a font standard used by the X Window System. It is intended to support:* unique, descriptive font names that support simple pattern matching * multiple font vendors, arbitrary character sets, and encodings * naming and instancing of… …   Wikipedia

  • (a) blow-by-blow description (of something) — a ˌblow by ˌblow acˈcount, deˈscription, etc. (of sth) idiom (informal) a description of an event which gives you all the details in the order in which they happen • He insisted on giving us a blow by blow account of what had happened. Main entry …   Useful english dictionary

  • Condensed detachment — (Rule D) is a method of finding the most general possible conclusion given two formal logical statements. It was developed by the Irish logician Carew Meredith in the 1950s and inspired by the work of Łukasiewicz. Contents 1 Informal description… …   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

  • Huffman coding — Huffman tree generated from the exact frequencies of the text this is an example of a huffman tree . The frequencies and codes of each character are below. Encoding the sentence with this code requires 135 bits, as opposed of 288 bits if 36… …   Wikipedia

  • Communicating sequential processes — In computer science, Communicating Sequential Processes (CSP) is a formal language for describing patterns of interaction in concurrent systems.[1] It is a member of the family of mathematical theories of concurrency known as process algebras, or …   Wikipedia

  • English orthography — is the alphabetic spelling system used by the English language. English orthography, like other alphabetic orthographies, uses a set of rules that generally governs how speech sounds are represented in writing. English has relatively complicated… …   Wikipedia

  • Lambda calculus — In mathematical logic and computer science, lambda calculus, also written as λ calculus, is a formal system designed to investigate function definition, function application and recursion. It was introduced by Alonzo Church and Stephen Cole… …   Wikipedia

Книги



Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»