that+cannot+be+computed
51Halting problem — In computability theory, the halting problem can be stated as follows: Given a description of a computer program, decide whether the program finishes running or continues to run forever. This is equivalent to the problem of deciding, given a… …
52Simulation — Simulator redirects here. For other uses, see Simulator (disambiguation). For other uses, see Simulation (disambiguation). Not to be confused with Stimulation. Wooden mechanical horse simulator during WWI. Simulation is the imitation of some real …
53LM hash — Lanman redirects here. For other uses, see Lanman (disambiguation). LM hash, LanMan, or LAN Manager hash was the primary hash that Microsoft LAN Manager and Microsoft Windows versions prior to Windows NT used to store user passwords. Support for… …
54Curvilinear coordinates — Curvilinear, affine, and Cartesian coordinates in two dimensional space Curvilinear coordinates are a coordinate system for Euclidean space in which the coordinate lines may be curved. These coordinates may be derived from a set of Cartesian… …
55Robust statistics — provides an alternative approach to classical statistical methods. The motivation is to produce estimators that are not unduly affected by small departures from model assumptions. Contents 1 Introduction 2 Examples of robust and non robust… …
56mental disorder — Any illness with a psychological origin, manifested either in symptoms of emotional distress or in abnormal behaviour. Most mental disorders can be broadly classified as either psychoses or neuroses (see neurosis; psychosis). Psychoses (e.g.,… …
57Galilean moons — Montage of Jupiter s four Galilean moons, in a composite image comparing their sizes and the size of Jupiter. From top to bottom: Io, Europa, Ganymede, Callisto The Galilean moons are the four moons of Jupiter discovered by Galileo Galilei in… …
58Photon — This article is about the elementary particle of light. For other uses, see Photon (disambiguation). Photon Photons emitted in a coherent beam from a laser Composition Elementary particle …
59Type system — Type systems Type safety Inferred vs. Manifest Dynamic vs. Static Strong vs. Weak Nominal vs. Structural Dependent typing Duck typing Latent typing Linear typing Uniqueness typing …
60Turing machine equivalents — Turing machine(s) Machina Universal Turing machine Alternating Turing machine Quantum Turing machine Read only Turing machine Read only right moving Turing Machines Probabilistic Turing machine Multi track Turing machine Turing machine… …
