model-theoretical structures. Computable model theory introduces the ideas of computable and decidable models and theories and one of the basic problems...

Computable functions are the basic objects of study in computability theory. Informally, a function is computable if there is an algorithm that computes...

more models of learning. The general scenario is the following: Given a class S of computable functions, is there a learner (that is, computable functional)...

In computability theory, a set of natural numbers is computable (or decidable or recursive) if there is an algorithm that computes the membership of every...

and infinite model theory are algorithmic or computable model theory and the study of 0-1 laws, where the infinite models of a generic theory of a class...

science, and more specifically in computability theory and computational complexity theory, a model of computation is a model which describes how an output...

science and mathematics, the theory of computation is the branch that deals with what problems can be solved on a model of computation, using an algorithm...

algorithm to solve the problem. The most widely studied models of computability are the Turing-computable and μ-recursive functions, and the lambda calculus...

categorical logic Finite model theory Descriptive complexity theory Model checking Trakhtenbrot's theorem Computable model theory Tarski's exponential function...

demanding that all such probability distributions be computable. Interestingly, the set of computable probability distributions is a subset of the set of...

what Turing did prove with his computational-machine model appears in his paper "On Computable Numbers, with an Application to the Entscheidungsproblem"...

of computable functions. It states that a function on the natural numbers can be calculated by an effective method if and only if it is computable by...

mathematics. Major subareas include model theory, proof theory, set theory, and recursion theory (also known as computability theory). Research in mathematical...

Measure theory — Model theory — Module theory — Morse theory — Nevanlinna theory — Number theory — Obstruction theory — Operator theory — Order theory — PCF...

Queueing theory is the mathematical study of waiting lines, or queues. A queueing model is constructed so that queue lengths and waiting time can be predicted...

Finite model theory is a subarea of model theory. Model theory is the branch of logic which deals with the relation between a formal language (syntax)...

The Annual ACM Symposium on Theory of Computing (STOC) is an academic conference in the field of theoretical computer science. STOC has been organized...

Enumerability: The set S is the range of a partial computable function. The set S is the range of a total computable function, or empty. If S is infinite, the...

Like the algebraic numbers, the computable numbers also form a subfield of the real numbers, and the positive computable numbers are closed under taking...

Computable General Equilibrium Modelling (2 volumes). North-Holland. ——, with Jerie, Michael; Rimmer, Maureen T. (2018). Trade Theory in Computable General...

carried out in a computable manner. It is closely related to constructive analysis. Computable model theory a branch of model theory dealing with the...

PMID 19797653. S2CID 17187000. Manin, Yu. I. (1980). Vychislimoe i nevychislimoe [Computable and Noncomputable] (in Russian). Soviet Radio. pp. 13–15. Archived from...

preferred over other theories-of-everything by Occam's Razor. Tegmark also considers augmenting the MUH with a second assumption, the computable universe hypothesis...

mathematics and computer science, computable analysis is the study of mathematical analysis from the perspective of computability theory. It is concerned with the...

testing the black box model. Data has to be written down before it is pulled for black box inputs. Black box theories are those theories defined only in terms...

such that either the addition or multiplication operation of the model is computable on the codes. This result was first obtained by Stanley Tennenbaum...

In model theory and related areas of mathematics, a type is an object that describes how a (real or possible) element or finite collection of elements...

In computability theory, many reducibility relations (also called reductions, reducibilities, and notions of reducibility) are studied. They are motivated...

are computable trees K {\displaystyle K} for which no computable such path through it exists. To prove this, one enumerates the partial computable sequences...

science and applied probability, ruin theory (sometimes risk theory or collective risk theory) uses mathematical models to describe an insurer's vulnerability...