SinIn a religious context, 'sin' is a transgression against divine law or a law of God. Each culture has its own interpretation of what it means to commit a sin. While sins are generally considered actions, any thought, word, or act considered immoral, selfish, shameful, harmful, or alienating might be termed "sinful".
Original sin'Original sin' is the Christian doctrine that holds that humans, through the fact of birth, inherit a tainted nature with a proclivity to sinful conduct in need of regeneration. The biblical basis for the belief is generally found in Genesis 3 (the story of the expulsion of Adam and Eve from the Garden of Eden), in a line in Psalm 51:5 ("I was brought forth in iniquity, and in sin did my mother conceive me"), and in Paul's Epistle to the Romans, 5:12-21 ("Therefore, just as sin entered the world through one man, and death through sin, and in this way death came to all people, because all sinned").
Direct sum of modulesIn abstract algebra, the direct sum is a construction which combines several modules into a new, larger module. The direct sum of modules is the smallest module which contains the given modules as submodules with no "unnecessary" constraints, making it an example of a coproduct. Contrast with the direct product, which is the notion. The most familiar examples of this construction occur when considering vector spaces (modules over a field) and abelian groups (modules over the ring Z of integers).
Christian views on sinIn Christianity, 'sin' is an immoral act considered to be a transgression of divine law. The doctrine of sin is central to the Christian faith, since its basic message is about redemption in Christ. Hamartiology, a branch of Christian theology which is the study of sin, describes sin as an act of offence against God by despising his persons and Christian biblical law, and by injuring others. Christian hamartiology is closely related to concepts of natural law, moral theology and Christian ethics.
Mortal sinA mortal sin (peccatum mortale), in Catholic theology, is a gravely sinful act which can lead to damnation if a person does not repent of the sin before death. It is alternatively called deadly, grave, and serious. A sin is considered to be "mortal" when its quality is such that it leads to a separation of that person from God's saving grace. Three conditions must together be met for a sin to be mortal: "Mortal sin is sin whose object is grave matter and which is also committed with full knowledge and deliberate consent.
Kolmogorov complexityIn algorithmic information theory (a subfield of computer science and mathematics), the Kolmogorov complexity of an object, such as a piece of text, is the length of a shortest computer program (in a predetermined programming language) that produces the object as output. It is a measure of the computational resources needed to specify the object, and is also known as algorithmic complexity, Solomonoff–Kolmogorov–Chaitin complexity, program-size complexity, descriptive complexity, or algorithmic entropy.
A* search algorithmA* (pronounced "A-star") is a graph traversal and path search algorithm, which is used in many fields of computer science due to its completeness, optimality, and optimal efficiency. One major practical drawback is its space complexity, as it stores all generated nodes in memory. Thus, in practical travel-routing systems, it is generally outperformed by algorithms that can pre-process the graph to attain better performance, as well as memory-bounded approaches; however, A* is still the best solution in many cases.
Binary search algorithmIn computer science, binary search, also known as half-interval search, logarithmic search, or binary chop, is a search algorithm that finds the position of a target value within a sorted array. Binary search compares the target value to the middle element of the array. If they are not equal, the half in which the target cannot lie is eliminated and the search continues on the remaining half, again taking the middle element to compare to the target value, and repeating this until the target value is found.
String-searching algorithmIn computer science, string-searching algorithms, sometimes called string-matching algorithms, are an important class of string algorithms that try to find a place where one or several strings (also called patterns) are found within a larger string or text. A basic example of string searching is when the pattern and the searched text are arrays of elements of an alphabet (finite set) Σ. Σ may be a human language alphabet, for example, the letters A through Z and other applications may use a binary alphabet (Σ = {0,1}) or a DNA alphabet (Σ = {A,C,G,T}) in bioinformatics.
QubitIn quantum computing, a qubit (ˈkjuːbɪt) or quantum bit is a basic unit of quantum information—the quantum version of the classic binary bit physically realized with a two-state device. A qubit is a two-state (or two-level) quantum-mechanical system, one of the simplest quantum systems displaying the peculiarity of quantum mechanics. Examples include the spin of the electron in which the two levels can be taken as spin up and spin down; or the polarization of a single photon in which the two states can be taken to be the vertical polarization and the horizontal polarization.
Grover's algorithmIn quantum computing, Grover's algorithm, also known as the quantum search algorithm, refers to a quantum algorithm for unstructured search that finds with high probability the unique input to a black box function that produces a particular output value, using just evaluations of the function, where is the size of the function's domain. It was devised by Lov Grover in 1996. The analogous problem in classical computation cannot be solved in fewer than evaluations (because, on average, one has to check half of the domain to get a 50% chance of finding the right input).
Dijkstra's algorithmDijkstra's algorithm (ˈdaɪkstrəz ) is an algorithm for finding the shortest paths between nodes in a weighted graph, which may represent, for example, road networks. It was conceived by computer scientist Edsger W. Dijkstra in 1956 and published three years later. The algorithm exists in many variants. Dijkstra's original algorithm found the shortest path between two given nodes, but a more common variant fixes a single node as the "source" node and finds shortest paths from the source to all other nodes in the graph, producing a shortest-path tree.
