Periodic tableThe periodic table, also known as the periodic table of the elements, arranges the chemical elements into rows ("periods") and columns ("groups"). It is an organizing icon of chemistry and is widely used in physics and other sciences. It is a depiction of the periodic law, which says that when the elements are arranged in order of their atomic numbers an approximate recurrence of their properties is evident. The table is divided into four roughly rectangular areas called blocks.
Block (periodic table)A block of the periodic table is a set of elements unified by the atomic orbitals their valence electrons or vacancies lie in. The term appears to have been first used by Charles Janet. Each block is named after its characteristic orbital: s-block, p-block, d-block, f-block and g-block. The block names (s, p, d, and f) are derived from the spectroscopic notation for the value of an electron's azimuthal quantum number: sharp (0), principal (1), diffuse (2), or fundamental (3).
Group (periodic table)In chemistry, a group (also known as a family) is a column of elements in the periodic table of the chemical elements. There are 18 numbered groups in the periodic table; the 14 f-block columns, between groups 2 and 3, are not numbered. The elements in a group have similar physical or chemical characteristics of the outermost electron shells of their atoms (i.e., the same core charge), because most chemical properties are dominated by the orbital location of the outermost electron.
Period (periodic table)A period on the periodic table is a row of chemical elements. All elements in a row have the same number of electron shells. Each next element in a period has one more proton and is less metallic than its predecessor. Arranged this way, elements in the same group (column) have similar chemical and physical properties, reflecting the periodic law. For example, the halogens lie in the second-to-last group (group 17) and share similar properties, such as high reactivity and the tendency to gain one electron to arrive at a noble-gas electronic configuration.
Extended periodic tableAn extended periodic table theorises about chemical elements beyond those currently known in the periodic table and proven. , the element with the highest atomic number known is oganesson (Z = 118), which completes the seventh period (row) in the periodic table. All elements in the eighth period and beyond thus remain purely hypothetical. Elements beyond 118 will be placed in additional periods when discovered, laid out (as with the existing periods) to illustrate periodically recurring trends in the properties of the elements concerned.
Periodic trendsIn chemistry, periodic trends are specific patterns that are present in the Periodic table that illustrate different aspects of certain elements when grouped by period and/or group. They were discovered by the Russian chemist Dmitri Mendeleev in the year 1863. Major periodic trends include atomic radius, ionization energy, electron affinity, electronegativity, valency and metallic character. These trends exist because of the similar electron configurations of the elements within their respective groups or periods; they reflect the periodic nature of the elements.
History of the periodic tableThe periodic table is an arrangement of the chemical elements, structured by their atomic number, electron configuration and recurring chemical properties. In the basic form, elements are presented in order of increasing atomic number, in the reading sequence. Then, rows and columns are created by starting new rows and inserting blank cells, so that rows (periods) and columns (groups) show elements with recurring properties (called periodicity). For example, all elements in group (column) 18 are noble gases that are largely—though not completely—unreactive.
Deep learningDeep learning is part of a broader family of machine learning methods, which is based on artificial neural networks with representation learning. The adjective "deep" in deep learning refers to the use of multiple layers in the network. Methods used can be either supervised, semi-supervised or unsupervised.
Computational complexityIn computer science, the computational complexity or simply complexity of an algorithm is the amount of resources required to run it. Particular focus is given to computation time (generally measured by the number of needed elementary operations) and memory storage requirements. The complexity of a problem is the complexity of the best algorithms that allow solving the problem. The study of the complexity of explicitly given algorithms is called analysis of algorithms, while the study of the complexity of problems is called computational complexity theory.
Complexity classIn computational complexity theory, a complexity class is a set of computational problems "of related resource-based complexity". The two most commonly analyzed resources are time and memory. In general, a complexity class is defined in terms of a type of computational problem, a model of computation, and a bounded resource like time or memory. In particular, most complexity classes consist of decision problems that are solvable with a Turing machine, and are differentiated by their time or space (memory) requirements.
Computational complexity theoryIn theoretical computer science and mathematics, computational complexity theory focuses on classifying computational problems according to their resource usage, and relating these classes to each other. A computational problem is a task solved by a computer. A computation problem is solvable by mechanical application of mathematical steps, such as an algorithm. A problem is regarded as inherently difficult if its solution requires significant resources, whatever the algorithm used.
Debate over the atomic bombings of Hiroshima and NagasakiSubstantial debate exists over the ethical, legal, and military aspects of the atomic bombings of Hiroshima and Nagasaki on 6 August and 9 August 1945 at the close of World War II (1939–45). On 26 July 1945, United States President Harry S. Truman, British Prime Minister Winston Churchill and President of China Chiang Kai-shek issued the Potsdam Declaration, which outlined the terms of surrender for the Empire of Japan as agreed upon at the Potsdam Conference.
Machine learningMachine learning (ML) is an umbrella term for solving problems for which development of algorithms by human programmers would be cost-prohibitive, and instead the problems are solved by helping machines 'discover' their 'own' algorithms, without needing to be explicitly told what to do by any human-developed algorithms. Recently, generative artificial neural networks have been able to surpass results of many previous approaches.
DeepDreamDeepDream is a computer vision program created by Google engineer Alexander Mordvintsev that uses a convolutional neural network to find and enhance patterns in s via algorithmic pareidolia, thus creating a dream-like appearance reminiscent of a psychedelic experience in the deliberately overprocessed images. Google's program popularized the term (deep) "dreaming" to refer to the generation of images that produce desired activations in a trained deep network, and the term now refers to a collection of related approaches.
Atomic orbitalIn atomic theory and quantum mechanics, an atomic orbital (ˈɔːrbɪtəl) is a function describing the location and wave-like behavior of an electron in an atom. This function can be used to calculate the probability of finding any electron of an atom in any specific region around the atom's nucleus. The term atomic orbital may also refer to the physical region or space where the electron can be calculated to be present, as predicted by the particular mathematical form of the orbital.
Quantum complexity theoryQuantum complexity theory is the subfield of computational complexity theory that deals with complexity classes defined using quantum computers, a computational model based on quantum mechanics. It studies the hardness of computational problems in relation to these complexity classes, as well as the relationship between quantum complexity classes and classical (i.e., non-quantum) complexity classes. Two important quantum complexity classes are BQP and QMA.
Materials scienceMaterials science is an interdisciplinary field of researching and discovering materials. Materials engineering is an engineering field of finding uses for materials in other fields and industries. The intellectual origins of materials science stem from the Age of Enlightenment, when researchers began to use analytical thinking from chemistry, physics, and engineering to understand ancient, phenomenological observations in metallurgy and mineralogy. Materials science still incorporates elements of physics, chemistry, and engineering.
Soviet atomic bomb projectThe Soviet atomic bomb project was the classified research and development program that was authorized by Joseph Stalin in the Soviet Union to develop nuclear weapons during and after World War II. Although the Soviet scientific community discussed the possibility of an atomic bomb throughout the 1930s, going as far as making a concrete proposal to develop such a weapon in 1940, the full-scale program was not initiated and prioritized until Nazi Germany invaded the Soviet Union.
Atomic bombings of Hiroshima and NagasakiOn 6 and 9 August 1945, the United States detonated two atomic bombs over the Japanese cities of Hiroshima and Nagasaki. The bombings killed between 129,000 and 226,000 people, most of whom were civilians, and remain the only use of nuclear weapons in an armed conflict. Japan surrendered to the Allies on 15 August, six days after the bombing of Nagasaki and the Soviet Union's declaration of war against Japan and invasion of Japanese-occupied Manchuria. The Japanese government signed the instrument of surrender on 2 September, effectively ending the war.
Exponential distributionIn probability theory and statistics, the exponential distribution or negative exponential distribution is the probability distribution of the time between events in a Poisson point process, i.e., a process in which events occur continuously and independently at a constant average rate. It is a particular case of the gamma distribution. It is the continuous analogue of the geometric distribution, and it has the key property of being memoryless. In addition to being used for the analysis of Poisson point processes it is found in various other contexts.
