Search results

Jump to navigation Jump to search
Results 1 – 21 of 248
Advanced search

Search in namespaces:

View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • ...mathematics]], '''computable measure theory''' is the part of [[computable analysis]] that deals with effective versions of [[measure theory]]. * Abbas Edalat (2009), "A computable approach to measure and integration theory", ''Information and Computation' ...
    731 bytes (81 words) - 23:07, 2 June 2017
  • ...sive''' if there is a [[Computable set|computable]] [[well-order]]ing of a computable [[subset]] of the [[natural numbers]] having the [[order type]] <math>\alph ...computable ordinal is computable, and the [[Set (mathematics)|set]] of all computable ordinals is [[closure (mathematics)|closed]] downwards. ...
    2 KB (240 words) - 22:15, 23 January 2024
  • ...tionistic logic)]], a principle in constructive analysis and in computable analysis ...
    556 bytes (57 words) - 02:34, 7 July 2023
  • == Functions computable by total Turing machines == {{main article|Computable function}} ...
    9 KB (1,405 words) - 23:35, 10 September 2023
  • ...Polynomial differential equations compute all real computable functions on computable compact intervals|journal=Journal of Complexity|volume=23|issue=3|pages=317 ...
    5 KB (627 words) - 15:08, 8 November 2024
  • ...putable complete set of invariants|reason=Shouldn't this be "finite set of computable invariants"? Computability (whatever this is supposed to mean on a set of f ==Analysis== ...
    5 KB (592 words) - 04:52, 15 September 2024
  • ...f(x) \in B</math>. A one-one reduction is an injective reduction, and a [[computable isomorphism]] is a bijective reduction. ...ty theory)|total numberings]] are one-equivalent if and only if they are [[computable isomorphism|recursively isomorphic]]. ...
    9 KB (1,345 words) - 22:41, 19 June 2025
  • ...computed to arbitrary precision, while [[almost every]] real number is not computable.]] In [[mathematics]], '''computable numbers''' are the [[real number]]s that can be computed to within any desi ...
    24 KB (3,449 words) - 09:07, 13 October 2025
  • *[[Computable number]] *[[Amortized analysis]] ...
    5 KB (517 words) - 16:43, 14 March 2025
  • ...pt for the one change at a time being analyzed. In [[general equilibrium]] analysis, on the other hand, the prices and quantities of all markets in the economy ...icroeconomic Theory'', Oxford University Press. </ref> General equilibrium analysis, in contrast, begins with tastes, endowments, and technology being fixed, b ...
    4 KB (562 words) - 15:46, 13 June 2024
  • | name = Global Trade Analysis Project (GTAP) ...= To provide leadership in [[Economic impact analysis|economic policy analysis]] by fostering collaboration to achieve better data and research outcomes. ...
    14 KB (1,827 words) - 01:35, 24 May 2025
  • *[[Chip Description File]], a genomic analysis file format *[[Computable Document Format]], a format for interactive data visualizations ...
    2 KB (285 words) - 12:54, 30 June 2025
  • ...function]] and its [[non-computable function|non-computability]] ("On Non-Computable Functions"). *with Paul V. Reichelderfer ''Continuous transformations in analysis - with an introduction to algebraic topology'', Springer 1955 ...
    6 KB (860 words) - 21:53, 18 April 2025
  • ...infinite path can be identified with a total function. This allows for an analysis using the techniques of computability theory. .../math> is computable the set <math>\operatorname{Ext}(T)</math> may not be computable. Whenever a subtree <math>T</math> of ...
    17 KB (2,630 words) - 06:49, 17 November 2025
  • ...lysis. Social Accounting Matrices (SAMs) were similarly a mainstay of Bank analysis, which had been adopted as a presentational device by the CGE modelers" (Mi SAMs form the backbone of [[computable general equilibrium]] (CGE) Models and various types of empirical multiplie ...
    11 KB (1,665 words) - 09:25, 10 February 2022
  • ...are studied in both effective descriptive set theory and in [[constructive analysis]]. In particular, standard examples of Polish spaces such as the [[real l ...
    3 KB (460 words) - 06:11, 4 March 2024
  • ...aching implications on the feasibility of [[static program analysis|static analysis]] of programs. It implies that it is impossible, for example, to implement ...uts a theoretical bound on which types of [[static program analysis|static analysis]] can be performed automatically. One can distinguish between the [[syntax ...
    12 KB (1,878 words) - 13:47, 14 November 2025
  • *[[Arithmetization of analysis]] *[[Computable model theory]] ...
    14 KB (1,402 words) - 00:08, 16 November 2024
  • In [[proof theory]], '''ludics''' is an analysis of the principles governing [[inference rule]]s of [[mathematical logic]]. ...ve content. For example, a realizer for the proposition "A implies B" is a computable function that takes a realizer for A, and uses it to compute a realizer for ...
    4 KB (528 words) - 20:11, 21 October 2024
  • ...ibrium Modelling PACKage''') is a [[computer model|modeling]] system for [[computable general equilibrium|CGE]] economic models, used at the Centre of Policy Stu ...constructed from a table of transaction values (such as an [[input-output analysis|input-output table]] or a [[social accounting matrix]]) that satisfies cert ...
    4 KB (596 words) - 17:10, 6 May 2023
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)