OpenAIOpenAI is an American artificial intelligence (AI) research laboratory consisting of the non-profit OpenAI, Inc. and its for-profit subsidiary corporation OpenAI, L.P.. OpenAI conducts research on artificial intelligence with the declared intention of developing "safe and beneficial" artificial general intelligence, which it defines as "highly autonomous systems that outperform humans at most economically valuable work".
Artificial intelligenceArtificial intelligence (AI) is the intelligence of machines or software, as opposed to the intelligence of human beings or animals. AI applications include advanced web search engines (e.g., Google Search), recommendation systems (used by YouTube, Amazon, and Netflix), understanding human speech (such as Siri and Alexa), self-driving cars (e.g., Waymo), generative or creative tools (ChatGPT and AI art), and competing at the highest level in strategic games (such as chess and Go).
Interior-point methodInterior-point methods (also referred to as barrier methods or IPMs) are a certain class of algorithms that solve linear and nonlinear convex optimization problems. An interior point method was discovered by Soviet mathematician I. I. Dikin in 1967 and reinvented in the U.S. in the mid-1980s. In 1984, Narendra Karmarkar developed a method for linear programming called Karmarkar's algorithm, which runs in provably polynomial time and is also very efficient in practice.
Shor's algorithmShor's algorithm is a quantum algorithm for finding the prime factors of an integer. It was developed in 1994 by the American mathematician Peter Shor. It is one of the few known quantum algorithms with compelling potential applications and strong evidence of superpolynomial speedup compared to best known classical (that is, non-quantum) algorithms. On the other hand, factoring numbers of practical significance requires far more qubits than available in the near future.
Mathematical optimizationMathematical optimization (alternatively spelled optimisation) or mathematical programming is the selection of a best element, with regard to some criterion, from some set of available alternatives. It is generally divided into two subfields: discrete optimization and continuous optimization. Optimization problems arise in all quantitative disciplines from computer science and engineering to operations research and economics, and the development of solution methods has been of interest in mathematics for centuries.
Generative artificial intelligenceGenerative artificial intelligence (AI) is artificial intelligence capable of generating text, images, or other media, using generative models. Generative AI models learn the patterns and structure of their input training data and then generate new data that has similar characteristics. In the early 2020s, advances in transformer-based deep neural networks enabled a number of generative AI systems notable for accepting natural language prompts as input.
Islamic StateThe Islamic State (IS), also known as the Islamic State of Iraq and the Levant (ISIL; ˈaɪsᵻl), Islamic State of Iraq and Syria (ISIS; ˈaɪsᵻs), and by its Arabic acronym Da'ish or Daesh (داعش, Dāʿish, ˈdaːʕɪʃ), is a transnational militant Islamist terrorist group and former unrecognized quasi-state that follows the Salafi jihadist branch of Sunni Islam. It was founded by Abu Musab al-Zarqawi in 1999 and gained global prominence in 2014, when it captured a large amount of Iraqi territory, and took advantage of the civil war in Syria to take control of chunks of territory in Eastern Syria.
AI alignmentIn the field of artificial intelligence (AI), AI alignment research aims to steer AI systems towards humans' intended goals, preferences, or ethical principles. An AI system is considered aligned if it advances the intended objectives. A misaligned AI system pursues some objectives, but not the intended ones. It can be challenging for AI designers to align an AI system because it can be difficult for them to specify the full range of desired and undesired behaviors.
Al-QaedaAl-Qaeda is a Sunni pan-Islamist militant organization led by Salafi jihadists who self-identify as a vanguard spearheading a global Islamist revolution to unite the Muslim world under a supra-national Islamic state known as the Caliphate. Its members are mostly composed of Arabs, but also include other peoples. Al-Qaeda has mounted attacks on civilian and military targets in various countries, including the 1998 United States embassy bombings and the September 11 attacks; it has been designated as a terrorist group by the United Nations Security Council, the North Atlantic Treaty Organization (NATO), the European Union, and various countries around the world.
Zaitsev's ruleIn organic chemistry, Zaitsev's rule (or Saytzeff's rule, Saytzev's rule) is an empirical rule for predicting the favored alkene product(s) in elimination reactions. While at the University of Kazan, Russian chemist Alexander Zaitsev studied a variety of different elimination reactions and observed a general trend in the resulting alkenes. Based on this trend, Zaitsev proposed that the alkene formed in greatest amount is that which corresponded to removal of the hydrogen from the alpha-carbon having the fewest hydrogen substituents.
Markovnikov's ruleIn organic chemistry, Markovnikov's rule or Markownikoff's rule describes the outcome of some addition reactions. The rule was formulated by Russian chemist Vladimir Markovnikov in 1870. The rule states that with the addition of a protic acid HX or other polar reagent to an asymmetric alkene, the acid hydrogen (H) or electropositive part gets attached to the carbon with more hydrogen substituents, and the halide (X) group or electronegative part gets attached to the carbon with more alkyl substituents.
Longest path problemIn graph theory and theoretical computer science, the longest path problem is the problem of finding a simple path of maximum length in a given graph. A path is called simple if it does not have any repeated vertices; the length of a path may either be measured by its number of edges, or (in weighted graphs) by the sum of the weights of its edges. In contrast to the shortest path problem, which can be solved in polynomial time in graphs without negative-weight cycles, the longest path problem is NP-hard and the decision version of the problem, which asks whether a path exists of at least some given length, is NP-complete.
