Solvability

  • 61Sheila Greibach — (1939 ) is a researcher in formal languages, automata, compiler theory in particular; and computer science in general. She is currently Professor of Computer Science at the University of California, Los Angeles.She worked with Seymour Ginsburg… …

    Wikipedia

  • 62New Mysterianism — This article is about a response to the mind body problem. For a general article on the limits of inquiry see cognitive closure. New Mysterianism is a philosophical position proposing that the hard problem of consciousness will never be… …

    Wikipedia

  • 63List of people affected by bipolar disorder — This is a list of people accompanied by verifiable source citations associating them with bipolar disorder. This list includes only: a) deceased persons; and b) living persons who have been frank about their condition. It does not include… …

    Wikipedia

  • 64Pure submodule — In mathematics, especially in the field of module theory, the concept of pure submodule provides a generalization of direct summand, a type of particularly well behaved piece of a module. Pure modules are complementary to flat modules and… …

    Wikipedia

  • 65Vladimir Drinfel'd — Born February 4, 1954 (1954 02 04) (age 57) Kharkiv, Ukrainian SSR, Soviet Union (currently in Ukraine) Nationality …

    Wikipedia

  • 66Nationalization — Not to be confused with Naturalization. Part of a series on Economic systems Ideological systems …

    Wikipedia

  • 67Cognitive closure (philosophy) — Problems of inquiry Cognitive closure (philosophy) Cognitive bias (psychology) Empirical limits in science This box: view · talk · …

    Wikipedia

  • 68List of undecidable problems — In computability theory, an undecidable problem is a problem whose language is not a recursive set. More informally, such problems cannot be solved in general by computers; see decidability. This is a list of undecidable problems. Note that there …

    Wikipedia

  • 69List of NP-complete problems — Here are some of the more commonly known problems that are NP complete when expressed as decision problems. This list is in no way comprehensive (there are more than 3000 known NP complete problems). Most of the problems in this list are taken… …

    Wikipedia

  • 70Abū Sahl al-Qūhī — transl|ar|ALA|Abū Sahl Wayjan ibn Rustam al Qūhī (sometimes transl|ar|ALA|al Kūhī), was a Persian [ [http://adsabs.harvard.edu/abs/2000eaa..bookE3410. al Quhi, Abu Sahl Wayjan ibn Rustam (c. 940 c. 1000) ] ] mathematician, physicist and… …

    Wikipedia