Chronology of the universeThe chronology of the universe describes the history and future of the universe according to Big Bang cosmology. Research published in 2015 estimates the earliest stages of the universe's existence as taking place 13.8 billion years ago, with an uncertainty of around 21 million years at the 68% confidence level. For the purposes of this summary, it is convenient to divide the chronology of the universe since it originated, into five parts.
Church–Turing thesisIn computability theory, the Church–Turing thesis (also known as computability thesis, the Turing–Church thesis, the Church–Turing conjecture, Church's thesis, Church's conjecture, and Turing's thesis) is a thesis about the nature of computable functions. It states that a function on the natural numbers can be calculated by an effective method if and only if it is computable by a Turing machine. The thesis is named after American mathematician Alonzo Church and the British mathematician Alan Turing.
Effective methodIn logic, mathematics and computer science, especially metalogic and computability theory, an effective method or effective procedure is a procedure for solving a problem by any intuitively 'effective' means from a specific class. An effective method is sometimes also called a mechanical method or procedure. The definition of an effective method involves more than the method itself. In order for a method to be called effective, it must be considered with respect to a class of problems.
Shing-Tung YauShing-Tung Yau (jaʊ; ; born April 4, 1949) is a Chinese-American mathematician and the William Caspar Graustein Professor of Mathematics at Harvard University. In April 2022, Yau announced retirement from Harvard to become Chair Professor of mathematics at Tsinghua University. Yau was born in Shantou, China, moved to Hong Kong at a young age, and to the United States in 1969. He was awarded the Fields Medal in 1982, in recognition of his contributions to partial differential equations, the Calabi conjecture, the positive energy theorem, and the Monge–Ampère equation.
PlateauIn geology and physical geography, a plateau (pləˈtoʊ,_plæˈtoʊ,_ˈplætoʊ; plato; : plateaus or plateaux), also called a high plain or a tableland, is an area of a highland consisting of flat terrain that is raised sharply above the surrounding area on at least one side. Often one or more sides have deep hills or escarpments. Plateaus can be formed by a number of processes, including upwelling of volcanic magma, extrusion of lava, and erosion by water and glaciers.
Colorado PlateauThe Colorado Plateau, also known as the Colorado Plateau Province, is a physiographic and desert region of the Intermontane Plateaus, roughly centered on the Four Corners region of the southwestern United States. This province covers an area of 336,700 km2 (130,000 mi2) within western Colorado, northwestern New Mexico, southern and eastern Utah, northern Arizona, and a tiny fraction in the extreme southeast of Nevada. About 90% of the area is drained by the Colorado River and its main tributaries: the Green, San Juan, and Little Colorado.
Tibetan PlateauThe Tibetan Plateau (, also known as the Qinghai–Tibet Plateau or the Qing–Zang Plateau () or as the Himalayan Plateau in India, is a vast elevated plateau located at the intersection of Central, South and East Asia covering most of the Tibet Autonomous Region, most of Qinghai, western half of Sichuan, Southern Gansu provinces in Western China, southern Xinjiang, Bhutan, the Indian regions of Ladakh and Lahaul and Spiti (Himachal Pradesh) as well as Gilgit-Baltistan in Pakistan, northwestern Nepal, eastern
Computably enumerable setIn computability theory, a set S of natural numbers is called computably enumerable (c.e.), recursively enumerable (r.e.), semidecidable, partially decidable, listable, provable or Turing-recognizable if: There is an algorithm such that the set of input numbers for which the algorithm halts is exactly S. Or, equivalently, There is an algorithm that enumerates the members of S. That means that its output is simply a list of all the members of S: s1, s2, s3, ... . If S is infinite, this algorithm will run forever.
