combinatorial logic

  • 111Action selection — is a way of characterizing the most basic problem of intelligent systems: what to do next. In artificial intelligence and computational cognitive science, the action selection problem is typically associated with intelligent agents and animats… …

    Wikipedia

  • 112Gaming mathematics — Gaming mathematics, also referred to as the mathematics of gambling, is a collection of probability applications encountered in games of chance and can be included in applied mathematics. From mathematical point of view, the games of chance are… …

    Wikipedia

  • 113History of group theory — The history of group theory, a mathematical domain studying groups in their various forms, has evolved in various parallel threads. There are three historical roots of group theory: the theory of algebraic equations, number theory and geometry.… …

    Wikipedia

  • 114MyHDL — MyHDL[1] is a Python based hardware description language (HDL). Features of MyHDL include: The ability to generate VHDL and Verilog code from a MyHDL design[2]. The ability to generate a testbench (Conversion of test benches[3]) with test vectors …

    Wikipedia

  • 115Список эпизодов сериала «4исла» — «4исла» (англ. Numb3rs)  детективный телевизионный сериал, созданный Николасом Фалаччи и Шерил Хьютон. Премьера телесериала состоялась 23 января 2005 года, 18 мая 2010 года CBS закрыл сериал …

    Википедия

  • 116Fuzz — may refer to: *Vellus, a type of short, fine body hair on an animal *Tomentum, a filamentous hairlike growth on a plant *Focus (optics), a blur effect *Fuzzbox, an electric guitar distortion effect *A derogatory slang term for the police… …

    Wikipedia

  • 117Ground expression — In mathematical logic, a ground term of a formal system is a term that does not contain any variables at all, and a closed term is a term that has no free variables. In first order logic all closed terms are ground terms, but in lambda calculus… …

    Wikipedia

  • 118Chu space — Chu spaces generalize the notion of topological space by dropping the requirements that the set of open sets be closed under union and finite intersection, that the open sets be extensional, and that the membership predicate (of points in open… …

    Wikipedia

  • 119P = NP problem — The relationship between the complexity classes P and NP is an unsolved question in theoretical computer science. It is considered to be the most important problem in the field – the Clay Mathematics Institute has offered a $1 million US prize… …

    Wikipedia

  • 120Martin Gardner — Born October 21, 1914(1914 10 21) Tulsa, Oklahoma, USA Died May 22, 2010(2010 05 22) (aged 95) …

    Wikipedia