Diamond cutA diamond cut is a style or design guide used when shaping a diamond for polishing such as the brilliant cut. Cut does not refer to shape (pear, oval), but the symmetry, proportioning and polish of a diamond. The cut of a diamond greatly affects a diamond's brilliance — a poorly-cut diamond is less luminous. In order to best use a diamond gemstone's material properties, a number of different diamond cuts have been developed. A diamond cut constitutes a more or less symmetrical arrangement of facets, which together modify the shape and appearance of a diamond crystal.
Nondeterministic Turing machineIn theoretical computer science, a nondeterministic Turing machine (NTM) is a theoretical model of computation whose governing rules specify more than one possible action when in some given situations. That is, an NTM's next state is not completely determined by its action and the current symbol it sees, unlike a deterministic Turing machine. NTMs are sometimes used in thought experiments to examine the abilities and limits of computers.
Diamond simulantA diamond simulant, diamond imitation or imitation diamond is an object or material with gemological characteristics similar to those of a diamond. Simulants are distinct from synthetic diamonds, which are actual diamonds exhibiting the same material properties as natural diamonds. Enhanced diamonds are also excluded from this definition. A diamond simulant may be artificial, natural, or in some cases a combination thereof.
Algorithmic efficiencyIn computer science, algorithmic efficiency is a property of an algorithm which relates to the amount of computational resources used by the algorithm. An algorithm must be analyzed to determine its resource usage, and the efficiency of an algorithm can be measured based on the usage of different resources. Algorithmic efficiency can be thought of as analogous to engineering productivity for a repeating or continuous process. For maximum efficiency it is desirable to minimize resource usage.
Randomized algorithmA randomized algorithm is an algorithm that employs a degree of randomness as part of its logic or procedure. The algorithm typically uses uniformly random bits as an auxiliary input to guide its behavior, in the hope of achieving good performance in the "average case" over all possible choices of random determined by the random bits; thus either the running time, or the output (or both) are random variables.
Distributed computingA distributed system is a system whose components are located on different networked computers, which communicate and coordinate their actions by passing messages to one another. Distributed computing is a field of computer science that studies distributed systems. The components of a distributed system interact with one another in order to achieve a common goal. Three significant challenges of distributed systems are: maintaining concurrency of components, overcoming the lack of a global clock, and managing the independent failure of components.
Blood diamondBlood diamonds (also called conflict diamonds, brown diamonds, hot diamonds, or red diamonds) are diamonds mined in a war zone and sold to finance an insurgency, an invading army's war efforts, terrorism, or a warlord's activity. The term is used to highlight the negative consequences of the diamond trade in certain areas, or to label an individual diamond as having come from such an area. Diamonds mined during the 20th–21st century civil wars in Angola, Ivory Coast, Sierra Leone, Liberia, Guinea, and Guinea-Bissau have been given the label.
Byzantine faultA Byzantine fault (also Byzantine generals problem, interactive consistency, source congruency, error avalanche, Byzantine agreement problem, and Byzantine failure) is a condition of a computer system, particularly distributed computing systems, where components may fail and there is imperfect information on whether a component has failed. The term takes its name from an allegory, the "Byzantine generals problem", developed to describe a situation in which, to avoid catastrophic failure of the system, the system's actors must agree on a concerted strategy, but some of these actors are unreliable.
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.
Synthetic diamondLab-grown diamond (LGD; also called laboratory-grown, laboratory-created, man-made, artisan-created, artificial, synthetic, or cultured diamond) is diamond that is produced in a controlled technological process (in contrast to naturally formed diamond, which is created through geological processes and obtained by mining). Unlike diamond simulants (imitations of diamond made of superficially similar non-diamond materials), synthetic diamonds are composed of the same material as naturally formed diamonds – pure carbon crystallized in an isotropic 3D form – and share identical chemical and physical properties.
