Computable
81Simulated reality — is the proposition that reality could be simulated perhaps by computer simulation to a degree indistinguishable from true reality. It could contain conscious minds which may or may not be fully aware that they are living inside a simulation. This …
82Blum's speedup theorem — In computational complexity theory Blum s speedup theorem, first stated by Manuel Blum in 1967, is an important theorem about the complexity of computable functions. Each computable function has an infinite number of different program… …
83Kleene's T predicate — In computability theory, the T predicate, first studied by mathematician Stephen Cole Kleene, is a particular set of triples of natural numbers that is used to represent computable functions within formal theories of arithmetic. Informally, the T …
84metalogic — /met euh loj ik/, n. the logical analysis of the fundamental concepts of logic. [1835 45; META + LOGIC] * * * Study of the syntax and the semantics of formal languages and formal systems. It is related to, but does not include, the formal… …
85General equilibrium — theory is a branch of theoretical microeconomics. It seeks to explain the behavior of supply, demand and prices in a whole economy with several or many markets. It is often assumed that agents are price takers and in that setting two common… …
86Integer sequence — In mathematics, an integer sequence is a sequence (i.e., an ordered list) of integers. An integer sequence may be specified explicitly by giving a formula for its nth term, or implicitly by giving a relationship between its terms. For example,… …
87Diagonal lemma — In mathematical logic, the diagonal lemma or fixed point theorem establishes the existence of self referential sentences in certain formal theories of the natural numbers specifically those theories that are strong enough to represent all… …
88List of mathematics articles (C) — NOTOC C C closed subgroup C minimal theory C normal subgroup C number C semiring C space C symmetry C* algebra C0 semigroup CA group Cabal (set theory) Cabibbo Kobayashi Maskawa matrix Cabinet projection Cable knot Cabri Geometry Cabtaxi number… …
89Utm theorem — In computability theory the utm theorem or universal turing machine theorem is a basic result about Gödel numberings of the set of computable functions. It proves the existence of a computable universal function which is capable of calculating… …
90Applied general equilibrium — (AGE) models were pioneered by Herbert Scarf at Yale University in 1967, in two papers, and a follow up book with Terje Hansen in 1973, with the aim of empirically estimating the Arrow Debreu General equilibrium model with empirical data, to… …
