|
Complete Numbering
In computability theory complete numberings are generalizations of Gödel numbering first introduced by A.I. Mal'tsev in 1963. They are studied because several important results like the Kleene's recursion theorem and Rice's theorem, which were originally proven for the Gödel-numbered set of computable functions, still hold for arbitrary sets with complete numberings. Definition A numbering \nu of a set A is called complete (with respect to an element a \in A) if for every partial computable function f there exists a total computable function h so that (Ershov 1999:482): : \nu \circ h(i) = \begin \nu \circ f(i) & \mbox ~ i \in \operatorname(f), \\ a & \mbox. \end Ershov refers to the element ''a'' as a "special" element for the numbering. A numbering \nu is called precomplete if the weaker property holds: : \nu \circ f(i) = \nu \circ h(i) \qquad i \in \operatorname(f). Examples * Any numbering of a singleton set is complete * The identity function on the natural n ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Computability Theory
Computability 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. Basic questions addressed by computability theory include: * What does it mean for a function on the natural numbers to be computable? * How can noncomputable functions be classified into a hierarchy based on their level of noncomputability? Although there is considerable overlap in terms of knowledge and methods, mathematical computability theorists study the theory of relative computability, reducibility notions, and degree structures; those in the computer science field focus on the theory of subrecursive hierarchies, formal methods, and formal languages. I ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Numbering (computability Theory)
In computability theory a numbering is the assignment of natural numbers to a set of objects such as functions, rational numbers, graphs, or words in some formal language. A numbering can be used to transfer the idea of computability and related concepts, which are originally defined on the natural numbers using computable functions, to these different types of objects. Common examples of numberings include Gödel numberings in first-order logic, the description numbers that arise from universal Turing machines and admissible numberings of the set of partial computable functions. Definition and examples A numbering of a set S is a surjective partial function from \mathbb to ''S'' (Ershov 1999:477). The value of a numbering ''ν'' at a number ''i'' (if defined) is often written ''ν''''i'' instead of the usual \nu(i) \!. Examples of numberings include: * The set of all finite subsets of \mathbb has a numbering \gamma , defined so that \gamma(0) = \emptyset and so that, for eac ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Kleene's Recursion Theorem
In computability theory, Kleene's recursion theorems are a pair of fundamental results about the application of computable functions to their own descriptions. The theorems were first proved by Stephen Kleene in 1938 and appear in his 1952 book ''Introduction to Metamathematics''. A related theorem, which constructs fixed points of a computable function, is known as Rogers's theorem and is due to Hartley Rogers, Jr. The recursion theorems can be applied to construct fixed points of certain operations on computable functions, to generate quines, and to construct functions defined via recursive definitions. Notation The statement of the theorems refers to an admissible numbering \varphi of the partial recursive functions, such that the function corresponding to index e is \varphi_e. If F and G are partial functions on the natural numbers, the notation F \simeq G indicates that, for each ''n'', either F(n) and G(n) are both defined and are equal, or else F(n) and G(n) are ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Rice's Theorem
In computability theory, Rice's theorem states that all non-trivial semantic properties of programs are undecidable. A semantic property is one about the program's behavior (for instance, does the program terminate for all inputs), unlike a syntactic property (for instance, does the program contain an if-then-else statement). A property is ''non-trivial'' if it is neither true for every partial computable function, nor false for every partial computable function. Rice's theorem can also be put in terms of functions: for any non-trivial property of partial functions, no general and effective method can decide whether an algorithm computes a partial function with that property. Here, a property of partial functions is called ''trivial'' if it holds for all partial computable functions or for none, and an effective decision method is called ''general'' if it decides correctly for every algorithm. The theorem is named after Henry Gordon Rice, who proved it in his doctoral dissertation ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Computable Function
Computable 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. Any definition, however, must make reference to some specific model of computation but all valid definitions yield the same class of functions. Particular models of computability that give rise to the set of computable functions are the Turing-computable functions and the general recursive functions. Before the precise definition of computable function, mathematicians often used the informal term ''effectively calculable''. This term has since come to be identified with the com ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Numbering (computability Theory)
In computability theory a numbering is the assignment of natural numbers to a set of objects such as functions, rational numbers, graphs, or words in some formal language. A numbering can be used to transfer the idea of computability and related concepts, which are originally defined on the natural numbers using computable functions, to these different types of objects. Common examples of numberings include Gödel numberings in first-order logic, the description numbers that arise from universal Turing machines and admissible numberings of the set of partial computable functions. Definition and examples A numbering of a set S is a surjective partial function from \mathbb to ''S'' (Ershov 1999:477). The value of a numbering ''ν'' at a number ''i'' (if defined) is often written ''ν''''i'' instead of the usual \nu(i) \!. Examples of numberings include: * The set of all finite subsets of \mathbb has a numbering \gamma , defined so that \gamma(0) = \emptyset and so that, for eac ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Partial Computable Function
Computable 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. Any definition, however, must make reference to some specific model of computation but all valid definitions yield the same class of functions. Particular models of computability that give rise to the set of computable functions are the Turing-computable functions and the general recursive functions. Before the precise definition of computable function, mathematicians often used the informal term ''effectively calculable''. This term has since come to be identified with the com ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Total Computable Function
Computable 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. Any definition, however, must make reference to some specific model of computation but all valid definitions yield the same class of functions. Particular models of computability that give rise to the set of computable functions are the Turing-computable functions and the general recursive functions. Before the precise definition of computable function, mathematicians often used the informal term ''effectively calculable''. This term has since come to be identified with the com ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Singleton Set
In mathematics, a singleton, also known as a unit set or one-point set, is a set with exactly one element. For example, the set \ is a singleton whose single element is 0. Properties Within the framework of Zermelo–Fraenkel set theory, the axiom of regularity guarantees that no set is an element of itself. This implies that a singleton is necessarily distinct from the element it contains, thus 1 and are not the same thing, and the empty set is distinct from the set containing only the empty set. A set such as \ is a singleton as it contains a single element (which itself is a set, however, not a singleton). A set is a singleton if and only if its cardinality is . In von Neumann's set-theoretic construction of the natural numbers, the number 1 is ''defined'' as the singleton \. In axiomatic set theory, the existence of singletons is a consequence of the axiom of pairing: for any set ''A'', the axiom applied to ''A'' and ''A'' asserts the existence of \, which is the same ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Identity Function
Graph of the identity function on the real numbers In mathematics, an identity function, also called an identity relation, identity map or identity transformation, is a function that always returns the value that was used as its argument, unchanged. That is, when is the identity function, the equality is true for all values of to which can be applied. Definition Formally, if is a set, the identity function on is defined to be a function with as its domain and codomain, satisfying In other words, the function value in the codomain is always the same as the input element in the domain . The identity function on is clearly an injective function as well as a surjective function, so it is bijective. The identity function on is often denoted by . In set theory, where a function is defined as a particular kind of binary relation, the identity function is given by the identity relation, or ''diagonal'' of . Algebraic properties If is any function, then we have ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Yuri Ershov
Yury Leonidovich Yershov (, born 1 May 194 is a Soviet and Russian mathematician. Yury Yershov was born in 1940 in Novosibirsk. In 1958 he entered the Tomsk State University and in 1963 graduated from the Mathematical Department of the Novosibirsk State University. In 1964 he successfully defended his PhD thesis "Decidable and Undecidable Theories" (advisor Anatoly Maltsev). In 1966 he successfully defended his DrSc thesis "Elementary Theory of Fields" (Элементарные теория полей). Apart from being a mathematician, Yershov was a member of the Communist Party and had different distinguished administrative duties in Novosibirsk State University. Yershov has been accused of antisemitic practices, and his visit to the U.S. in 1980 drew public protests by a number of U.S. mathematicians. Yershov himself denied the validity of these accusations. Yury Yershov is a member of the Russian Academy of Sciences, professor emeritus of Novosibirsk State University an ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Algebra I Logika
''Algebra i Logika'' (English: ''Algebra and Logic'') is a peer-reviewed Russian mathematical journal founded in 1962 by Anatoly Ivanovich Malcev, published by the Siberian Fund for Algebra and Logic at Novosibirsk State University. An English translation of the journal is published by Springer-Verlag as ''Algebra and Logic'' since 1968. It published papers presented at the meetings of the "Algebra and Logic" seminar at the Novosibirsk State University. The journal is edited by academician Yury Yershov. The journal is reviewed cover-to-cover in ''Mathematical Reviews'' and ''Zentralblatt MATH''. Abstracting and Indexing ''Algebra i Logika'' is indexed and abstracted in the following databases: According to the ''Journal Citation Reports'', the journal had a 2020 impact factor The impact factor (IF) or journal impact factor (JIF) of an academic journal is a scientometric index calculated by Clarivate that reflects the yearly mean number of citations of articles published ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |