No results for "Computability and recursion theory" (auto) in titles.

Suggestions for article titles:

1. 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 ... (Study of computable functions and Turing degrees) [100%] 2022-11-13 [Computability theory] [Mathematical logic]...
2. 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 ... (Study of computable functions and Turing degrees) [100%] 2024-01-26 [Computability theory] [Mathematical logic]...
3. 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 ... (Study of computable functions and Turing degrees) [100%] 2024-10-01 [Computability theory] [Mathematical logic]...
4. Repulsion theory: In botany, Repulsion theory is a theory that is used to explain how plants regulate the distance between new budding leaves on a stem. The theory states that each leaf on a stem secretes a substance that inhibits growth of ... (Biology) [86%] 2023-11-24 [Plant morphology]
5. Computability: An algorithm is called computable if it can be encoded into a set of instructions, which can be input into a universal Turing machine for processing, and the universal Turing machine eventually halts. How to decide if an arbitrary algorithm ... [84%] 2023-10-21 [Logic] [Computer Science]...
6. Computability: Computability is the ability to solve a problem in an effective manner. It is a key topic of the field of computability theory within mathematical logic and the theory of computation within computer science. (Ability to solve a problem in an effective manner) [84%] 2024-05-27 [Computability theory] [Theory of computation]...
7. Recursion: Recursion is the repeated application of a procedure or definition through reference to itself. There's a simple procedure for finding out whether a number is divisible by three. [83%] 2023-03-13 [Computer Science] [Mathematics]...
8. Recursion: Recursion occurs when the definition of a concept or process depends on a simpler or previous version of itself. Recursion is used in a variety of disciplines ranging from linguistics to logic. (Process of repeating items in a self-similar way) [83%] 2023-12-20 [Recursion] [Theory of computation]...
9. Recursion: Recursion occurs when the definition of a concept or process depends on a simpler version of itself. Recursion is used in a variety of disciplines ranging from linguistics to logic. (Process of repeating items in a self-similar way) [83%] 2023-11-24 [Recursion] [Theory of computation]...
10. Recursion (computer science): In computer science, recursion is a method of solving a computational problem where the solution depends on solutions to smaller instances of the same problem. Recursion solves such recursive problems by using functions that call themselves from within their own ... (Computer science) [83%] 2023-11-25 [Theoretical computer science] [Recursion]...
11. Recursion: A method of defining functions studied in the theory of algorithms and other branches of mathematical logic. This method has been used for a long time in arithmetic to define sequences of numbers (progressions, Fibonacci numbers, etc.). (Mathematics) [83%] 2023-11-25
12. Alpha recursion theory: In recursion theory, α recursion theory is a generalisation of recursion theory to subsets of admissible ordinals \displaystyle{ \alpha }[/math]. An admissible set is closed under \displaystyle{ \Sigma_1(L_\alpha) }[/math] functions, where \displaystyle{ L_\xi }[/math] denotes a rank of ... [81%] 2024-03-23 [Computability theory]
13. Compatibility (mechanics): In continuum mechanics, a compatible deformation (or strain) tensor field in a body is that unique tensor field that is obtained when the body is subjected to a continuous, single-valued, displacement field. Compatibility is the study of the conditions ... (Physics) [71%] 2023-10-17 [Continuum mechanics] [Elasticity (physics)]...
14. Compatibility (chemical): Chemical compatibility is a rough measure of how stable a substance is when mixed with another substance. If two substances can mix together and not undergo a chemical reaction, they are considered compatible. (Chemical) [71%] 2023-09-25 [Chemical safety]
15. Comparability: In mathematics, two elements x and y of a set P are said to be comparable with respect to a binary relation ≤ if at least one of x ≤ y or y ≤ x is true. They are called incomparable if they ... (Property of elements related by inequalities) [71%] 2023-10-13 [Binary relations] [Order theory]...
16. Compatibility (geochemistry): Compatibility is a term used by geochemists to describe how elements partition themselves in the solid and melt within Earth's mantle. In geochemistry, compatibility is a measure of how readily a particular trace element substitutes for a major element ... (Chemistry) [71%] 2024-01-01 [Geochemistry] [Geology]...
17. Compatibility (mechanics): In continuum mechanics, a compatible deformation (or strain) tensor field in a body is that unique tensor field that is obtained when the body is subjected to a continuous, single-valued, displacement field. Compatibility is the study of the conditions ... (Mechanics) [71%] 2024-04-11 [Continuum mechanics] [Elasticity (physics)]...
18. Computability and Complexity: A mathematical problem is computable if it can be solved in principle by a computing device. Some common synonyms for “computable” are “solvable”, “decidable”, and “recursive”. (Philosophy) [71%] 2022-02-22
19. Recursive model theory: recursively presented model theory A branch of mathematics that is on the border-line between model theory, algebra and the theory of recursive functions (cf. Recursive function), and related to the study of questions of effectiveness in models and algebras. (Mathematics) [70%] 2023-10-17
20. Recursive set theory: A branch of the theory of recursive functions (cf. Recursive function) that examines and classifies subsets of natural numbers from the point of view of algorithms, and also studies the structures arising as a result of such a classification. (Mathematics) [70%] 2023-10-17