King James VersionThe King James Version (KJV), also the King James Bible (KJB) and the Authorized Version (AV), is an Early Modern English translation of the Christian Bible for the Church of England, which was commissioned in 1604 and published in 1611, by sponsorship of King James VI and I. The 80 books of the King James Version include 39 books of the Old Testament, 14 books of Apocrypha, and the 27 books of the New Testament.
New TestamentThe New Testament (NT) is the second division of the Christian biblical canon. It discusses the teachings and person of Jesus, as well as events in first-century Christianity. The New Testament's background, the first division of the Christian Bible, is called the Old Testament, which is based primarily upon the Hebrew Bible; together they are regarded as sacred scripture by Christians. The New Testament is a collection of Christian texts originally written in the Koine Greek language, at different times by various authors.
Aix-en-ProvenceAix-en-Provence (UKˌɛks_ɒ̃_prɒˈvɒ̃s, USˌeɪks_ɒ̃_proʊˈvɒ̃s,ˌɛks-), or simply Aix (medieval Occitan: Aics), is a city and commune in southern France, about north of Marseille. A former capital of Provence, it is the subprefecture of the arrondissement of Aix-en-Provence, in the department of Bouches-du-Rhône, in the region of Provence-Alpes-Côte d'Azur. The population of Aix-en-Provence is approximately 145,000. Its inhabitants are called Aixois or, less commonly, Aquisextains.
Computable functionComputable functions are the basic objects of study in computability theory. Computable functions are the formalized analogue of the intuitive notion of algorithms, in the sense that a function is computable if there exists an algorithm that can do the job of the function, i.e. given an input of the function domain it can return the corresponding output. Computable functions are used to discuss computability without referring to any concrete model of computation such as Turing machines or register machines.
Rational pointIn number theory and algebraic geometry, a rational point of an algebraic variety is a point whose coordinates belong to a given field. If the field is not mentioned, the field of rational numbers is generally understood. If the field is the field of real numbers, a rational point is more commonly called a real point. Understanding rational points is a central goal of number theory and Diophantine geometry. For example, Fermat's Last Theorem may be restated as: for n > 2, the Fermat curve of equation has no other rational points than (1, 0), (0, 1), and, if n is even, (–1, 0) and (0, –1).
Circle groupIn mathematics, the circle group, denoted by or , is the multiplicative group of all complex numbers with absolute value 1, that is, the unit circle in the complex plane or simply the unit complex numbers The circle group forms a subgroup of , the multiplicative group of all nonzero complex numbers. Since is abelian, it follows that is as well. A unit complex number in the circle group represents a rotation of the complex plane about the origin and can be parametrized by the angle measure : This is the exponential map for the circle group.
Blackboard boldBlackboard bold is a style of writing bold symbols on a blackboard by doubling certain strokes, commonly used in mathematical lectures, and the derived style of typeface used in printed mathematical texts. The style is most commonly used to represent the number sets (natural numbers), (integers), (rational numbers), (real numbers), and (complex numbers). To imitate a bold typeface on a typewriter, a character can be typed over itself (called double-striking); symbols thus produced are called double-struck, and this name is sometimes adopted for blackboard bold symbols, for instance in Unicode glyph names.
Computability theoryComputability theory, also known as recursion theory, is a branch of mathematical logic, computer science, and the theory of computation that originated in the 1930s with the study of computable functions and Turing degrees. The field has since expanded to include the study of generalized computability and definability. In these areas, computability theory overlaps with proof theory and effective descriptive set theory.
