Radio clockA radio clock or radio-controlled clock (RCC), and often (incorrectly and colloquially) referred to as an "atomic clock", is a type of quartz clock or watch that is automatically synchronized to a time code transmitted by a radio transmitter connected to a time standard such as an atomic clock. Such a clock may be synchronized to the time sent by a single transmitter, such as many national or regional time transmitters, or may use the multiple transmitters used by satellite navigation systems such as Global Positioning System.
Galileo affairThe Galileo affair (il processo a Galileo Galilei) began around 1610 and culminated with the trial and condemnation of Galileo Galilei by the Roman Catholic Inquisition in 1633. Galileo was prosecuted for his support of heliocentrism, the astronomical model in which the Earth and planets revolve around the Sun at the centre of the universe. In 1610, Galileo published his Sidereus Nuncius (Starry Messenger), describing the observations that he had made with his new, much stronger telescope, amongst them, the Galilean moons of Jupiter.
Satellite laser rangingIn satellite laser ranging (SLR) a global network of observation stations measures the round trip time of flight of ultrashort pulses of light to satellites equipped with retroreflectors. This provides instantaneous range measurements of millimeter level precision which can be accumulated to provide accurate measurement of orbits and a host of important scientific data. The laser pulse can also be reflected by the surface of a satellite without a retroreflector, which is used for tracking space debris.
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.
Geosynchronous satelliteA geosynchronous satellite is a satellite in geosynchronous orbit, with an orbital period the same as the Earth's rotation period. Such a satellite returns to the same position in the sky after each sidereal day, and over the course of a day traces out a path in the sky that is typically some form of analemma. A special case of geosynchronous satellite is the geostationary satellite, which has a geostationary orbit – a circular geosynchronous orbit directly above the Earth's equator.
Positioning systemA positioning system is a system for determining the position of an object in space. One of the most well-known and commonly used positioning systems is the Global Positioning System (GPS). Positioning system technologies exist ranging from worldwide coverage with meter accuracy to workspace coverage with sub-millimeter accuracy. Interplanetary-radio communication systems not only communicate with spacecraft, but they are also used to determine their position.
Receiver autonomous integrity monitoringReceiver autonomous integrity monitoring (RAIM) is a technology developed to assess the integrity of global positioning system (GPS) signals in a GPS receiver system. It is of special importance in safety-critical GPS applications, such as in aviation or marine navigation. GPS does not include any internal information about the integrity of its signals. It is possible for a GPS satellite to broadcast slightly incorrect information that will cause navigation information to be incorrect, but there is no way for the receiver to determine this using the standard techniques.
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.
P (complexity)In computational complexity theory, P, also known as PTIME or DTIME(nO(1)), is a fundamental complexity class. It contains all decision problems that can be solved by a deterministic Turing machine using a polynomial amount of computation time, or polynomial time. Cobham's thesis holds that P is the class of computational problems that are "efficiently solvable" or "tractable". This is inexact: in practice, some problems not known to be in P have practical solutions, and some that are in P do not, but this is a useful rule of thumb.
L (complexity)In computational complexity theory, L (also known as LSPACE or DLOGSPACE) is the complexity class containing decision problems that can be solved by a deterministic Turing machine using a logarithmic amount of writable memory space. Formally, the Turing machine has two tapes, one of which encodes the input and can only be read, whereas the other tape has logarithmic size but can be read as well as written. Logarithmic space is sufficient to hold a constant number of pointers into the input and a logarithmic number of boolean flags, and many basic logspace algorithms use the memory in this way.
