* [[Signature (Computer Science)]], in computer science
533 bytes (54 words) - 07:06, 24 March 2023
...lfloor x\rfloor$; the classical notation is $[x]$. In computer science and computer languages it is often denoted by $\operatorname{int}(x)$.
...Knuth, O. Patashnik, "Concrete mathematics: a foundation for computer science" , Addison-Wesley (1990)</TD></TR><TR><TD valign="top">[a2]</TD> <TD valig
1 KB (158 words) - 12:37, 27 August 2014
...m from $A$ onto $C$. As usual, $\Sigma$ designates a [[Signature (Computer Science)|signature]]. A Gödelization could be understood as encoding of the elemen
...braic Specification", in J. van Leeuwen, "Handbook of Theoretical Computer Science", Elsevier 1990 {{ZBL|0900.68309}}
2 KB (241 words) - 07:50, 21 March 2023
...cessary compatibility with $\Sigma$. In the case of [[Signature (Computer Science)#Signatures with Special Properties|sensible signatures]] $\Sigma$, it exi
...raic Specification", in J. van Leeuwen: "Handbook of Theoretical Computer Science", Elsevier 1990
3 KB (426 words) - 17:09, 8 February 2013
...natization is some kind of a representation of a [[Sigma-algebra (Computer Science)|$\Sigma$-algebra]] $A$ by a $\Sigma$-algebra consisting of natural numbers
...mputable function|computability]] (and other areas of theoretical computer science) can be transferred to $\Sigma$-algebras. Accordingly, a coordinatization i
3 KB (404 words) - 09:05, 21 April 2013
...a real number (or numbers) cannot be absolutely correctly implemented on a computer, due to the finite representation of real numbers in computers. Instead of
...ne has to use specialized [[Software|software]]. To encode algorithms on a computer, special language means are required. These are also considered in the theo
2 KB (270 words) - 17:01, 7 February 2011
Aside from [[number theory]], these tests are of interest in computer science because it is not known whether there is a deterministic polynomial-time al
...number theory" J. van Leeuwen (ed.) , ''Handbook of Theoretical Computer Science'' , '''A''' , MIT (1990)</TD></TR>
3 KB (485 words) - 22:01, 25 October 2014
...stems (see [[System (in a category)|System (in a category)]]). In computer science, data structures are often modelled by partially ordered sets in which ever
2 KB (292 words) - 06:36, 14 October 2014
...These values $a_1,\ldots,a_n$ are elements of a [[Sigma-algebra (Computer Science)|$\Sigma$-algebra]] $A$, whereby the sorts of $a_i$ and $X_i$ coincide in e
...braic Specification", in J. van Leeuwen: "Handbook of Theoretical Computer Science", Elsevier 1990
3 KB (467 words) - 12:21, 3 March 2013
...its great universality and the relative simplicity of implementing it on a computer.
...top"> L. Lapodus, "Numerical solution of partial differential equations in science and engineering", Wiley (1982)</TD></TR>
763 bytes (107 words) - 08:25, 28 April 2023
In computer science, this operation is known as "Currying" after Haskell Curry (1900-1982).
* Benjamin C. Pierce, ''Basic Category Theory for Computer Scientists'', MIT Press (1991) {{ISBN|0262660717}}
2 KB (289 words) - 11:59, 23 November 2023
...Computer Science)|$\Sigma$-algebra]] belonging to a [[Signature (Computer Science)|signature $\Sigma$]]. This is caused by several reasons.
...\neq\emptyset$, then a $\Sigma$-algebra $A\in K$ [[Sigma-algebra (Computer Science)|initial]] in $K$ is term-generated {{Cite|EM85}}.
6 KB (940 words) - 19:31, 20 February 2013
...as pre-order, a vertex ordering which plays an important role in computer science.
...> A.V. Aho, J.E. Hopcroft, J.D. Ullman, "The design and analysis of computer algorithms" , Addison-Wesley (1976)</TD></TR>
3 KB (440 words) - 21:26, 15 November 2014
* Allen B. Tucker, "Computer Science Handbook", 2nd ed. CRC Press (2004) {{ISBN|158488360X}}
1 KB (173 words) - 07:29, 14 November 2023
The definition as given comes from information theory. In computer science the term "bit" usually refers to the representation of "0" or "1" by
1 KB (174 words) - 10:59, 29 May 2020
...s and Morphisms|ground terms]] $t\in T(\Sigma)$ of a [[Signature (Computer Science)|signature]] $\Sigma$ is called an <i>evaluation</i>. Since interpretations
1 KB (186 words) - 14:35, 21 April 2013
...alized language|formalized language]] defined over a [[Signature (Computer Science)|signature]] $\Sigma =(S,F)$ and a set of variables. For terms as informal
Let $\Sigma =(S,F)$ be a [[Signature (Computer Science)|signature]]. Let $X_s$ be a set of variables of sort $s\in S$ with $X_s\
5 KB (955 words) - 16:09, 28 January 2013
...variables, whereas the semantics is defined by a [[Sigma-algebra (Computer Science)|$\Sigma$-algebra $A$]]. An interpretation $v^\ast \colon T(\Sigma,X) \long
...braic Specification", in J. van Leeuwen: "Handbook of Theoretical Computer Science", Elsevier 1990
6 KB (991 words) - 21:29, 24 March 2013
...top"> L. Lovász, D.B. Shmoys, E. Tardos, "Combinatorics in computer science" R.L. Graham (ed.) M. Grötschel (ed.) L. Lovász (ed.) , ''Handbook of
2 KB (405 words) - 19:42, 6 September 2017
...en Vickers ''Topology via Logic'' Cambridge Tracts in Theoretical Computer Science '''5''' Cambridge University Press (1989) {{ISBN|0-521-36062-5}} {{ZBL|0668
1 KB (198 words) - 16:50, 4 November 2023