- correctness problem
- мат. задача о правильности
Большой англо-русский и русско-английский словарь. 2001.
correctness problem
Смотреть что такое "correctness problem" в других словарях:
Correctness (computer science) — In theoretical computer science, correctness of an algorithm is asserted when it is said that the algorithm is correct with respect to a specification. Functional correctness refers to the input output behaviour of the algorithm (i.e., for each… … Wikipedia
Political correctness — Politically incorrect redirects here. For other uses, see Politically incorrect (disambiguation). Political correctness (adjectivally, politically correct; both forms commonly abbreviated to PC) is a term which denotes language, ideas, policies,… … Wikipedia
Political Correctness — Politische Korrektheit (häufig als Adjektiv politisch korrekt, engl.: Political Correctness [pəˈlɪtɪkəl kəˈrɛktnɪs] und politically correct, Abk. PC, P.C. und pc) ist ein aus dem angelsächsischen Raum stammendes politisches Schlagwort.… … Deutsch Wikipedia
Political correctness — Politische Korrektheit (häufig als Adjektiv politisch korrekt, engl.: Political Correctness [pəˈlɪtɪkəl kəˈrɛktnɪs] und politically correct, Abk. PC, P.C. und pc) ist ein aus dem angelsächsischen Raum stammendes politisches Schlagwort.… … Deutsch Wikipedia
Yao's Millionaires' Problem — is a secure multiparty communication problem which was introduced by Andrew Yao, a prominent computer scientist and computational theorist. The problem discusses two millionaires, Alice and Bob, who are interested in knowing which of them is… … Wikipedia
Halting problem — In computability theory, the halting problem can be stated as follows: Given a description of a computer program, decide whether the program finishes running or continues to run forever. This is equivalent to the problem of deciding, given a… … Wikipedia
Robert S. Boyer — Robert Stephen Boyer, aka Bob Boyer, is a professor of computer science, mathematics, and philosophy at The University of Texas at Austin. He and J Strother Moore invented the Boyer Moore string search algorithm, a particularly efficient string… … Wikipedia
Dining cryptographers protocol/Rewrite — Problem Statement Dining Cryptographers A group of cryptographers is enjoying dinner at a local restaurant. Upon requesting their bill, the cryptographers are surprised to learn from their host that payment for the dinner has already been… … Wikipedia
Global serializability — In concurrency control of databases, transaction processing (transaction management), and other transactional distributed applications, Global serializability (or Modular serializability) is a property of a global schedule of transactions. A… … Wikipedia
Serializability — In concurrency control of databases,[1][2] transaction processing (transaction management), and various transactional applications (e.g., transactional memory[3] and software transactional memory), both centralized and distributed, a transaction… … Wikipedia
Religion (Philosophies of) — Philosophies of religion Marcel, Jaspers, Levinas William Desmond Gabriel Marcel (1889–1973), Karl Jaspers (1883–1969) and Emmanuel Levinas (1906–) seem like a mere aggregate of thinkers. Jaspers, a German thinker who coined the phrase Existenz… … History of philosophy
