Search results

...Richard Büchi]]. The [[signature (mathematical logic)|signature]] of Büchi arithmetic contains only the addition operation, <math>V_k</math> and equality, omitti ...chi arithmetic, whether that sentence is provable from the axioms of Büchi arithmetic. ...

...g machine|Turing-machine]] model and the [[Arithmetic model of computation|arithmetic model]]. A '''strongly-polynomial time algorithm''' is polynomial in both m ...g machine|Turing-machine]] model and the [[Arithmetic model of computation|arithmetic model]]:<ref name=":0" />{{Rp|page=32}} ...

...nalysis]], a '''binade''' is a set of numbers in a binary [[Floating-point arithmetic|floating-point format]] that all have the same sign and exponent. |title=Handbook of Floating-Point Arithmetic ...

...-Northern Research]] in the 1980s and 1990s. Embedding relational interval arithmetic in a logic programming language differs from other constraint logic program ...bolic processing. BNR Prolog was the first such implementation of interval arithmetic in a logic programming language.<ref>{{cite book| year=2006 |editor1-last=R ...

...ary digits, called [[bit]]s, necessary to represent an unsigned [[integer (computer science)|integer]]<ref>{{cite web |url=http://reference.wolfram.com/mathema ...puter processors]] are often designed to process data grouped into [[word (computer architecture)|words]] of a given length of bits (8 bit, 16 bit, 32 bit, 64 ...

...er languages that allow a function to call itself recursively |Recursion (computer science)}} ...longs to the language and halts and rejects it otherwise. In [[theoretical computer science]], such always-halting Turing machines are called [[total Turing ma ...

'''AN codes''' are [[error-correcting code]] that are used in arithmetic applications. ...rs would be unreliable since any errors would go undetected. AN codes are arithmetic codes that are named for the integers <math>A</math> and <math>N</math> tha ...

except for the fact that the [[carry (arithmetic)|carry]] .../math> and <math>(X^7\cdot X^2)+(X^5\cdot X^4)\equiv0</math> thanks to the arithmetic in GF(2). This corresponds to the columns marked <code>^</code> in the exam ...

|title=Handbook of Floating-Point Arithmetic }}</ref> is a [[Floating-point arithmetic|floating-point]] algorithm for computing the exact [[round-off error]] in a ...

...te=1975 |volume=40 |issue=3 |pages=347–382 }}</ref> or some [[Second-order arithmetic|higher-order arithmetics]]. ===Arithmetic and computability=== ...

...It was developed by [[Kurt Gödel]] to provide a [[consistency proof]] of arithmetic. The name of the interpretation comes from the journal ''[[Dialectica]]'', ...relative [[consistency]] proof for Heyting arithmetic (and hence for Peano arithmetic). ...

...he [[function composition|composition]] of a finite number of [[arithmetic|arithmetic operations]] {{nowrap|(+, −, ×, ÷)}}, [[exponential function|exponential]]s ...the set of Liouvillian functions is [[closure (mathematics)|closed]] under arithmetic operations, composition, and integration. It is also closed under [[derivat ...

...eger]]s and each gate of the circuit computes either a set operation or an arithmetic operation on its input sets. | journal =Theoretical Computer Science ...

In [[floating-point arithmetic]], the '''Sterbenz lemma''' or '''Sterbenz's lemma'''<ref name="handbook">{ |title=Handbook of Floating-Point Arithmetic ...

...anch (computer science)|branch]]-free implementation, it is widely used in computer graphics applications.{{sfn|Shirley|Wald|Marrs|2021}}{{sfn|Majercik|Crassin ...e ray itself does not lie on one of the faces of the bounding box. In such arithmetic, the intersections with the planes parallel to the ray will be given by <ma ...

...el is a [[model of computation]] in which a [[random-access machine]] does arithmetic and bitwise operations on a word of {{mvar|w}} bits. [[Michael Fredman]] an ...can be indexed with {{mvar|w}}-bit addresses.</ref> The model allows both arithmetic operations and [[bitwise operations]] including [[logical shift]]s to be do ...

...nch and bound|branch-and-bound]] algorithms classically used in [[Interval arithmetic|interval analysis]]. Most of them are based on interval arithmetic. ...

...[polynomials]] are identical. More formally, a PIT algorithm is given an [[arithmetic circuit]] that computes a polynomial ''p'' in a [[Field (mathematics)|field ...recent results and open questions." Foundations and Trends in Theoretical Computer Science 5.3–4 (2010): 207-388.</ref> ...

In [[mathematics]], '''[[arithmetic]] combinatorics''' is a field in the intersection of [[number theory]], [[c Arithmetic combinatorics is about combinatorial estimates associated with arithmetic operations (addition, subtraction, multiplication, and division). [[Additi ...

...st2=Derek A.|year=2003|title=On Quaternions and Octonions: Their Geometry, Arithmetic, and Symmetry|publisher=A. K. Peters, Ltd.|isbn=978-1-56881-134-5|postscrip *{{citation|series=Lecture Notes in Computer Science |volume= 4249|year= 2006|pages=445–459 ...