Search results

• Module:TableTools
  -- This function returns true if the given value is a positive integer, and false function p.isPositiveInteger(v)
  12 KB (1,700 words) - 07:32, 16 July 2021
• Module:Infobox mapframe
  function trimArgs(argsTable) function getBestStatement(item_id, property_id)
  13 KB (1,821 words) - 23:19, 15 July 2021
• Module:Buffer
  local function Valid(v)--type validation local noOp, MBpairs = function()end do local iMap, vMap, oMap, pIter, pOther, pFast, Next--Map
  27 KB (4,517 words) - 20:52, 15 July 2021
• Module:ConvertNumeric
  local function roman_to_numeral(roman) local function numeral_to_english_less_100(num, ordinal, plural, zero)
  23 KB (3,154 words) - 21:09, 15 July 2021
• Module:Buffer/doc
  ...er object when the module returned by {{luaref|require||y}} is called as a function{{--}}i.e., there is no 'main'. ...o {{luaself|:_}}; if that op is not desired, you may chain a Buffer object function directly to the module and the self-action will be redirected to a new Buff
  86 KB (13,859 words) - 20:52, 15 July 2021
• Module:Wd
  local function loadI18n(aliasesP, frame) -- allows for recursive calls
  67 KB (9,114 words) - 07:57, 16 July 2021
• Directory:Jon Awbrey/Papers/Cactus Language
  ...well enough understood, then the language can begin to acquire a semantic function. In natural circumstances, the syntax and the semantics are likely to be e # The first is a function that takes each sentence of the language into a computational data structur
  211 KB (31,551 words) - 20:44, 2 August 2017
• Introduction to Inquiry Driven Systems
  80 bytes (10 words) - 11:56, 6 October 2010
• Directory:Jon Awbrey/Papers/Inquiry Driven Systems : Part 4
  Do all the varieties of inquiry have something in common, a structure or a function that defines the essence of inquiry itself? I will say "yes". One advanta ...e reserved in category theory to refer to the domain and the codomain of a function, mapping, or transformation. This will limit their use, in the above sense
  92 KB (15,197 words) - 14:40, 24 August 2017
• Directory talk:Jon Awbrey/Papers/Inquiry Driven Systems : Part 6
  ...to the consideration of ''systems of interpretation'' (SOIs) that maintain recursive mechanisms for naming everything within their purview. This “nominal ...viding names for signs and expressions, is usually regarded as a ''quoting function''.
  290 KB (38,052 words) - 18:21, 28 August 2014
• Directory:Jon Awbrey/Papers/Introduction to Inquiry Driven Systems
  Do all the varieties of inquiry have something in common, a structure or a function that defines the essence of inquiry itself? I will say “yes”. ...y theory to refer to the domain and the codomain of an "arrow", that is, a function, a mapping, a morphism, or a transformation. This will limit their use in
  121 KB (16,341 words) - 04:34, 30 October 2015
• Philosophy of mathematics
  ...ts have been made to use the concepts of [[Turing machine]] or [[recursive function]] to fill this gap, leading to the claim that only questions regarding the ...mes. The first was Euclid's, the second was based on the [[Euler]] [[zeta function]], and the third was Chaitin's own, derived from [[algorithmic information
  73 KB (10,917 words) - 19:48, 6 September 2017
• User:Jon Awbrey/PROSPECT
  function there, and as such can be generalized to a probability distribution of knowledge-directed systems whose intelligence can function in real time.
  162 KB (25,941 words) - 13:28, 9 January 2008
• User:Jon Awbrey/Mathematical Notes
  | with diagrams of arrows. Each arrow f : X -> Y represents a function; | function g o f : X -> Z, defined by x ~> g(f x). The same diagrams apply
  567 KB (86,909 words) - 21:00, 6 December 2016
• Directory:Jon Awbrey/Papers/Inquiry Driven Systems : Part 1
  ...nown'', or ''to whom it may concern'' appearing in a system of potentially recursive constraints. As such, it serves in the role of an indeterminate symbol, in ...and not as constructs that lie beyond their scope. Any time the levels of recursive discussion become too involved to manage successfully, one needs to keep av
  241 KB (38,416 words) - 15:14, 15 April 2017
• Directory:Jon Awbrey/VORPALS
  ...ts have been made to use the concepts of [[Turing machine]] or [[recursive function]] to fill this gap, leading to the claim that only questions regarding the ...ts have been made to use the concepts of [[Turing machine]] or [[recursive function]] to fill this gap, leading to the claim that only questions regarding the
  177 KB (26,694 words) - 02:20, 15 December 2010
• Directory:Jon Awbrey/Papers/Inquiry Driven Systems : Part 3
  ...and actually increase the power of the recursion. Of course, the use of a recursive strategy comes at the expense of having to establish a more extended result ...uiry is especially significant when contemplating programs of inquiry with recursive definitions, like the motivating case of inquiry into inquiry. It means th
  138 KB (23,322 words) - 14:50, 4 January 2015
• User:Jon Awbrey/IDS
  "to whom it may concern" appearing in a system of potentially recursive striking scene, especially for a setting that is intended to function as
  665 KB (109,541 words) - 02:46, 13 September 2010
• Directory:Jon Awbrey/Essays/Prospects For Inquiry Driven Systems
  ...A subset of a tangent space at a point can be viewed as a boolean-valued function there, and as such can be generalized to a probability distribution that is ...implement the brands of knowledge-directed systems whose intelligence can function in real time. To provide a computational language that can help to clarify
  226 KB (34,541 words) - 14:20, 20 August 2016
• User:Jon Awbrey/Examples Of Inquiry
  so long as you acknowledge the conducive function or the mediating role It is the form and function of these models that gives them their
  139 KB (16,717 words) - 14:30, 12 September 2017

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)