Received: from 173-13-139-235-sfba.hfc.comcastbusiness.net ([173.13.139.235]:33612 helo=jukni.digitalkingdom.org) by stodi.digitalkingdom.org with smtp (Exim 4.85) (envelope-from ) id 1a7WYr-0003V9-Lb; Fri, 11 Dec 2015 14:53:18 -0800 Received: by jukni.digitalkingdom.org (sSMTP sendmail emulation); Fri, 11 Dec 2015 14:53:13 -0800 From: "Apache" Date: Fri, 11 Dec 2015 14:53:13 -0800 To: webmaster@lojban.org, curtis289@att.net Subject: [jvsw] Definition Edited At Word ji'i'u -- By krtisfranks Bcc: jbovlaste-admin@lojban.org Message-ID: <566b53d9.rFbG5w+iY4/KLbIB%webmaster@lojban.org> User-Agent: Heirloom mailx 12.5 7/5/10 MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: quoted-printable X-Spam-Score: 3.2 (+++) X-Spam_score: 3.2 X-Spam_score_int: 32 X-Spam_bar: +++ X-Spam-Report: Spam detection software, running on the system "stodi.digitalkingdom.org", has NOT identified this incoming email as spam. The original message has been attached to this so you can view it or label similar future email. If you have any questions, see the administrator of that system for details. Content preview: In jbovlaste, the user krtisfranks has edited a definition of "ji'i'u" in the language "English". Differences: 2,2c2,2 < mekso at-most-4-ary operator: a rounding function; ordered input list is $(x,n,m,t)$ and the output is $b^(-t) *$ round($b^t * x$), with rounding preference $n$ where the fractional part being 1/2 maps $b^t * x$ to the nearest integer of form $2Z+m$, for base b and an integer Z --- > mekso at-most-4-ary operator: a rounding function; ordered input list is $(x,n,m,t)$ and the output is $b^{(-t)} *$ round($b^t * x$), with rounding preference $n$ and where the fractional part of $b^t * x$ being 1/2 causes the function to map $b^t * x$ to the nearest integer of form $2Z+m$, for base b and an integer Z determined by context 5,5c5,5 < x must be a real number; n must be exactly one of exactly the following: -1, 0, 1; m must be 0 xor 1 if defined at all; t must be an integer if defined at all. n does not have a contextless default value. m is defined iff n = 0; if m is undefined, then its slot is automatically and implicitly deleted from this word in that context (so the operator is at-most-3-ary and a third argument would fill the 't' slot under the condition that t is defined). If m is defined, then its contextless default value is m = 0. It first determines the base being used for interpretation of digit strings (determined by context or by explicit specification (JUHAU)); this determination takes place even before inputs are accepted; let this base be represented by b throughout this description. If the base is not a positional system wherein each digit represents a corresponding multiple of a fixed natural number raised to the power of its position (as determined relative to the radix point) and wherein the overall number is the sum of these results/representands, then t is defined; if the base is sufficiently bad or unclear, then t is undefined; if t is undefined, then its slot is automatically and implicitly deleted from this word in that context (so the operator is at-most-3-ary and its input acceptance is terminated by the n or m slot, whichever one is later yet defined). If t is defined, then its [...] Content analysis details: (3.2 points, 5.0 required) pts rule name description ---- ---------------------- -------------------------------------------------- 0.0 URIBL_BLOCKED ADMINISTRATOR NOTICE: The query to URIBL was blocked. See http://wiki.apache.org/spamassassin/DnsBlocklists#dnsbl-block for more information. [URIs: lojban.org] 1.4 RCVD_IN_BRBL_LASTEXT RBL: No description available. [173.13.139.235 listed in bb.barracudacentral.org] 0.8 BAYES_50 BODY: Bayes spam probability is 40 to 60% [score: 0.4175] 1.0 RDNS_DYNAMIC Delivered to internal network by host with dynamic-looking rDNS In jbovlaste, the user krtisfranks has edited a definition of "ji'i'u" in the language "English". Differences: 2,2c2,2 < =09=09mekso at-most-4-ary operator: a rounding function; ordered inpu= t list is $(x,n,m,t)$ and the output is $b^(-t) *$ round($b^t * x$), wi= th rounding preference $n$ where the fractional part being 1/2 maps $b^= t * x$ to the nearest integer of form $2Z+m$, for base b and an integer= Z --- > =09=09mekso at-most-4-ary operator: a rounding function; ordered inpu= t list is $(x,n,m,t)$ and the output is $b^{(-t)} *$ round($b^t * x$), = with rounding preference $n$ and where the fractional part of $b^t * x$= being 1/2 causes the function to map $b^t * x$ to the nearest integer= of form $2Z+m$, for base b and an integer Z determined by context 5,5c5,5 < =09=09x must be a real number; n must be exactly one of exactly the f= ollowing: -1, 0, 1; m must be 0 xor 1 if defined at all; t must be an i= nteger if defined at all. n does not have a contextless default value. = m is defined iff n =3D 0; if m is undefined, then its slot is automatic= ally and implicitly deleted from this word in that context (so the oper= ator is at-most-3-ary and a third argument would fill the 't' slot unde= r the condition that t is defined). If m is defined, then its contextle= ss default value is m =3D 0. It first determines the base being used fo= r interpretation of digit strings (determined by context or by explicit= specification (JUHAU)); this determination takes place even before inp= uts are accepted; let this base be represented by b throughout this des= cription. If the base is not a positional system wherein each digit rep= resents a corresponding multiple of a fixed natural number raised to th= e power of its position (as determined relative to the radix point) and= wherein the overall number is the sum of these results/representands, = then t is defined; if the base is sufficiently bad or unclear, then t i= s undefined; if t is undefined, then its slot is automatically and impl= icitly deleted from this word in that context (so the operator is at-mo= st-3-ary and its input acceptance is terminated by the n or m slot, whi= chever one is later yet defined). If t is defined, then its contextless= default value is t =3D 0. The rounding function, determined by n, is = performed (b^(t))*x. If n =3D 1, then the rounding function is the ceil= ing function: (b^(t))*x is mapped to the least integer that is greater = than or equal to it. If n =3D -1, then the rounding function is the fl= oor function: (b^(t))*x is mapped to the greatest integer that is less = than or equal to it. These integers are both determined by the ordering= and metric. If n =3D 0, then the rounding function maps (b^(t))*x to t= he integer that minimizes the metric distance between itself and (b^(t)= )*x if a unique such integer exists (id est: (b^(t))*x is mapped to the= nearest integer, where "nearest"-ness is determined according to the o= rder and metric); if no such unique integer exists, then (b^(t))*x is m= apped to the unique integer among these aforementioned options for whic= h there exists an integer Z such that 2Z+m is the integer in question; = if no unique such integer exists, then the function is undefined. Thus = n =3D 0 produces the commonly used unbiased nearest-integer rounding fu= nction. In each of these cases, the output of the rounding function is= then multiplied by b^(-t). Thus, it rounds at the $t$th digit. The or= der on, and the operators and metric endowing, the metric space and fie= ld of all real numbers is determined by context or by explicit specific= ation. --- > =09=09x must be a real number; n must be exactly one of exactly the f= ollowing: -1, 0, 1; m must be 0 xor 1 if defined at all; t must be an i= nteger if defined at all; the output is a real number. n does not have = a contextless default value. m is defined iff n =3D 0; if m is undefine= d, then its slot is automatically and implicitly deleted from this word= in that context (so the operator is at-most-3-ary and a third argument= would fill the 't' slot under the condition that t is defined). If m i= s defined, then its contextless default value is m =3D 0. It first dete= rmines the base being used for interpretation of digit strings (determi= ned by context or by explicit specification (JUHAU)); this determinatio= n takes place even before inputs are accepted; let this base be represe= nted by b throughout this description. If the base is not a positional = system wherein each digit represents a corresponding multiple of a fixe= d natural number raised to the power of its position (as determined rel= ative to the radix point) and wherein the overall number is the sum of = these results/representands, then t is defined; if the base is sufficie= ntly bad or unclear, then t is undefined; if t is undefined, then its s= lot is automatically and implicitly deleted from this word in that cont= ext (so the operator is at-most-3-ary and its input acceptance is termi= nated by the n or m slot, whichever one is later yet defined) and b =3D= 1 for the purposes of this definition (but not for any digit-to-number= interpretation/conversion!). If t is defined, then its contextless def= ault value is t =3D 0. The rounding function, determined by n, is perf= ormed (b^(t))*x. If n =3D 1, then the rounding function is the ceiling = function: (b^(t))*x is mapped to the least integer that is greater than= or equal to it. If n =3D -1, then the rounding function is the floor = function: (b^(t))*x is mapped to the greatest integer that is less than= or equal to it. These integers are both determined by the ordering and= metric. If n =3D 0, then the rounding function maps (b^(t))*x to the i= nteger that minimizes the metric distance between itself and (b^(t))*x = if a unique such integer exists (id est: (b^(t))*x is mapped to the nea= rest integer, where "nearest"-ness is determined according to the order= and metric); if no such unique integer exists, then (b^(t))*x is mappe= d to the unique integer among these aforementioned options for which th= ere exists an integer Z such that 2Z+m is the integer in question; if n= o unique such integer exists, then the function is undefined. Thus n = =3D 0 produces the commonly used unbiased nearest-integer rounding func= tion. In each of these cases, the output of the rounding function is t= hen multiplied by b^(-t). Thus, it rounds at the $t$th digit, so to sp= eak. The order on, and the operators and metric endowing, the metric sp= ace and field of all real numbers is determined by context or by explic= it specification. 11,12d10 < =09=09Word: rounding function, In Sense: rounds at given digit < =09=09Word: nearest integer function, In Sense:=20 \n14a13,14 \n> =09=09Word: nearest integer function, In Sense:=20 > =09=09Word: rounding function, In Sense: rounds at given digit Old Data: =09Definition: =09=09mekso at-most-4-ary operator: a rounding function; ordered input = list is $(x,n,m,t)$ and the output is $b^(-t) *$ round($b^t * x$), with= rounding preference $n$ where the fractional part being 1/2 maps $b^t = * x$ to the nearest integer of form $2Z+m$, for base b and an integer Z =09Notes: =09=09x must be a real number; n must be exactly one of exactly the fol= lowing: -1, 0, 1; m must be 0 xor 1 if defined at all; t must be an int= eger if defined at all. n does not have a contextless default value. m = is defined iff n =3D 0; if m is undefined, then its slot is automatical= ly and implicitly deleted from this word in that context (so the operat= or is at-most-3-ary and a third argument would fill the 't' slot under = the condition that t is defined). If m is defined, then its contextless= default value is m =3D 0. It first determines the base being used for = interpretation of digit strings (determined by context or by explicit s= pecification (JUHAU)); this determination takes place even before input= s are accepted; let this base be represented by b throughout this descr= iption. If the base is not a positional system wherein each digit repre= sents a corresponding multiple of a fixed natural number raised to the = power of its position (as determined relative to the radix point) and w= herein the overall number is the sum of these results/representands, th= en t is defined; if the base is sufficiently bad or unclear, then t is = undefined; if t is undefined, then its slot is automatically and implic= itly deleted from this word in that context (so the operator is at-most= -3-ary and its input acceptance is terminated by the n or m slot, which= ever one is later yet defined). If t is defined, then its contextless d= efault value is t =3D 0. The rounding function, determined by n, is pe= rformed (b^(t))*x. If n =3D 1, then the rounding function is the ceilin= g function: (b^(t))*x is mapped to the least integer that is greater th= an or equal to it. If n =3D -1, then the rounding function is the floo= r function: (b^(t))*x is mapped to the greatest integer that is less th= an or equal to it. These integers are both determined by the ordering a= nd metric. If n =3D 0, then the rounding function maps (b^(t))*x to the= integer that minimizes the metric distance between itself and (b^(t))*= x if a unique such integer exists (id est: (b^(t))*x is mapped to the n= earest integer, where "nearest"-ness is determined according to the ord= er and metric); if no such unique integer exists, then (b^(t))*x is map= ped to the unique integer among these aforementioned options for which = there exists an integer Z such that 2Z+m is the integer in question; if= no unique such integer exists, then the function is undefined. Thus n = =3D 0 produces the commonly used unbiased nearest-integer rounding func= tion. In each of these cases, the output of the rounding function is t= hen multiplied by b^(-t). Thus, it rounds at the $t$th digit. The orde= r on, and the operators and metric endowing, the metric space and field= of all real numbers is determined by context or by explicit specificat= ion. =09Jargon: =09=09 =09Gloss Keywords: =09=09Word: rounding function, In Sense: rounds at given digit =09=09Word: nearest integer function, In Sense:=20 =09=09Word: ceiling function, In Sense:=20 =09=09Word: floor function, In Sense:=20 =09Place Keywords: New Data: =09Definition: =09=09mekso at-most-4-ary operator: a rounding function; ordered input = list is $(x,n,m,t)$ and the output is $b^{(-t)} *$ round($b^t * x$), wi= th rounding preference $n$ and where the fractional part of $b^t * x$ = being 1/2 causes the function to map $b^t * x$ to the nearest integer o= f form $2Z+m$, for base b and an integer Z determined by context =09Notes: =09=09x must be a real number; n must be exactly one of exactly the fol= lowing: -1, 0, 1; m must be 0 xor 1 if defined at all; t must be an int= eger if defined at all; the output is a real number. n does not have a = contextless default value. m is defined iff n =3D 0; if m is undefined,= then its slot is automatically and implicitly deleted from this word i= n that context (so the operator is at-most-3-ary and a third argument w= ould fill the 't' slot under the condition that t is defined). If m is = defined, then its contextless default value is m =3D 0. It first determ= ines the base being used for interpretation of digit strings (determine= d by context or by explicit specification (JUHAU)); this determination = takes place even before inputs are accepted; let this base be represent= ed by b throughout this description. If the base is not a positional sy= stem wherein each digit represents a corresponding multiple of a fixed = natural number raised to the power of its position (as determined relat= ive to the radix point) and wherein the overall number is the sum of th= ese results/representands, then t is defined; if the base is sufficient= ly bad or unclear, then t is undefined; if t is undefined, then its slo= t is automatically and implicitly deleted from this word in that contex= t (so the operator is at-most-3-ary and its input acceptance is termina= ted by the n or m slot, whichever one is later yet defined) and b =3D 1= for the purposes of this definition (but not for any digit-to-number i= nterpretation/conversion!). If t is defined, then its contextless defau= lt value is t =3D 0. The rounding function, determined by n, is perfor= med (b^(t))*x. If n =3D 1, then the rounding function is the ceiling fu= nction: (b^(t))*x is mapped to the least integer that is greater than o= r equal to it. If n =3D -1, then the rounding function is the floor fu= nction: (b^(t))*x is mapped to the greatest integer that is less than o= r equal to it. These integers are both determined by the ordering and m= etric. If n =3D 0, then the rounding function maps (b^(t))*x to the int= eger that minimizes the metric distance between itself and (b^(t))*x if= a unique such integer exists (id est: (b^(t))*x is mapped to the neare= st integer, where "nearest"-ness is determined according to the order a= nd metric); if no such unique integer exists, then (b^(t))*x is mapped = to the unique integer among these aforementioned options for which ther= e exists an integer Z such that 2Z+m is the integer in question; if no = unique such integer exists, then the function is undefined. Thus n =3D = 0 produces the commonly used unbiased nearest-integer rounding function= . In each of these cases, the output of the rounding function is then = multiplied by b^(-t). Thus, it rounds at the $t$th digit, so to speak.= The order on, and the operators and metric endowing, the metric space = and field of all real numbers is determined by context or by explicit s= pecification. =09Jargon: =09=09 =09Gloss Keywords: =09=09Word: ceiling function, In Sense:=20 =09=09Word: floor function, In Sense:=20 =09=09Word: nearest integer function, In Sense:=20 =09=09Word: rounding function, In Sense: rounds at given digit =09Place Keywords: You can go to to see it.