* [[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
* Allen B. Tucker, "Computer Science Handbook", 2nd ed. CRC Press (2004) {{ISBN|158488360X}}
1 KB (226 words) - 07:28, 14 November 2023
...bounding it from above and below, that have an exact representation in the computer. Thus, each quantity is replaced by an interval containing it. Under the ar
...top"> K. Nickel (ed.) , ''Interval mathematics'' , ''Lect. notes in comp. science'' , '''29''' , Springer (1975)</TD></TR></table>
5 KB (677 words) - 22:13, 5 June 2020
...onald E.; Patashnik, Oren "Concrete mathematics: a foundation for computer science" (2nd ed.) Addison-Wesley (1994) {{ISBN|0201558025}} {{ZBL|0836.00001}}
2 KB (239 words) - 16:50, 23 November 2023
...Typical examples of complex systems are: the nervous system, the brain, a computer, a control system in human society, etc.
...others. In particular, [[Cybernetics|cybernetics]] arose as an independent science. In it a fundamental notion is that of a complex [[Control system|control s
4 KB (532 words) - 17:22, 7 February 2011
...emantics|semantical behaviours]] associated with the [[Signature (Computer Science)|signature]] $\Sigma=(S,F)$.
...braic Specification", in J. van Leeuwen: "Handbook of Theoretical Computer Science", Elsevier 1990
8 KB (1,264 words) - 16:16, 18 February 2013
...rofound changes in scientific methodology have opened new horizons for the science of mathematics at a speed without parallel during the long history of mathe
...inning" of computers and computer science. Secondly, advances in computer science have induced very vigorous developments in certain branches of mathematics.
13 KB (2,014 words) - 20:35, 31 December 2018
...ferent optimization problems (including [[dynamic programming]]), computer science, automata and formal language theory, numerical methods, [[parallel program
...> A.V. Aho, J.E. Hopcroft, J.D. Ullman, "The design and analysis of computer algorithms" , Addison-Wesley (1976)</TD></TR>
7 KB (1,026 words) - 20:42, 16 November 2023
...rence, DLT 2011, Milan, Italy, July 19-22, 2011" Lecture Notes in Computer Science '''6795''' (2011), , Springer-Verlag (2011) {{ISBN|978-3-642-22320-4}} {{DO
...2006, Santa Barbara, CA, USA, June 26-29, 2006", Lecture Notes in Computer Science '''4036''' Springer (2006) {{ISBN|3-540-35428-X}} {{ZBL|1227.68074}}
4 KB (579 words) - 20:19, 7 November 2023
...eorgia Martin, "Bounded Queries in Recursion Theory", Progress in Computer Science and Applied Logic '''16'''. Springer (1999) {{ISBN|0817639667}}</TD></TR>
2 KB (294 words) - 07:46, 18 November 2023
...trade-off between using adaptive or non-adaptive information on a parallel computer should be carried out.
...al integration on advanced computer systems" , ''Lecture Notes in Computer Science'' , '''848''' , Springer (1994) {{MR|1324342}} {{ZBL|0825.65012}} {{ZBL|090
4 KB (650 words) - 15:07, 14 February 2020
...throughs. Nevertheless, Horn clause logic is today widely used in computer science as a well understood tool. In-depth theoretical expositions of Horn clause
...rences|[a13]]], which belongs to complexity theory of theoretical computer science, [[#References|[a12]]].
7 KB (1,111 words) - 06:59, 21 October 2016
...y the existence of a general recursive function (in programming, a partial computer; in the theory of computable functions, an $ s- m- n $-
As is obvious from this identity, a partial computer constructs from a program of $ m + n $
6 KB (919 words) - 08:26, 6 June 2020
...les and let $v\in B(A,X)$ be an assignement in a [[Sigma-algebra (Computer Science)|$\Sigma$-algebra]] $A$. Then $v$ <i>satisfies</i> $p$ in $A$, written as $
...braic Specification", in J. van Leeuwen: "Handbook of Theoretical Computer Science", Elsevier 1990
8 KB (1,390 words) - 18:36, 11 December 2020
...uations and bottlenecks, computer-aided synthesis of parallel programs and computer components, etc.). It was introduced by C. Petri in the 1960s. A Petri net
..."> W. Reisig, "Petri nets" , ''EATCS Monographs on Theoretical Computer Science'' , '''4''' , Springer (1985) {{ZBL|0555.68033}}</TD></TR></table>
6 KB (897 words) - 19:23, 16 August 2016
''computer software''
...tion of user jobs into the computer is organized; and effective use of the computer equipment is provided (see [[#References|[1]]]–[[#References|[4]]]).
19 KB (2,814 words) - 17:16, 7 February 2011
...tside mathematics are logic, linguistics and computer science. In computer science the whole issue on correctness of programs (either in the context of correc
...applications of Montague grammar" , '''1: Philosophy, framework, computer science''' , CWI (1986)</TD></TR></table>
9 KB (1,407 words) - 19:01, 21 November 2018
...en Vickers ''Topology via Logic'' Cambridge Tracts in Theoretical Computer Science '''5''' Cambridge University Press (1989) {{ISBN|0-521-36062-5}} {{ZBL|0668
3 KB (403 words) - 08:08, 26 November 2023
..., H.J. Weinert, ''Semirings: Algebraic Theory and Applications in Computer Science'' World Scientific (1998) {{ISBN|9814495697}} {{ZBL|0934.16046}}
2 KB (371 words) - 05:54, 15 April 2023
...problem of simulating quantum systems, known to be tractable on a quantum computer, relates to the problems conventionally studied within classical computatio
...ibed above firmly established the field of quantum computation in computer science. However, it was initially unclear whether quantum computation was a physic
15 KB (2,154 words) - 17:45, 1 July 2020
...scale representation of sensory data developed by the image processing and computer vision communities. The purpose is to represent signals at multiple scales
...td valign="top">[a9]</td> <td valign="top"> "Geometry-driven diffusion in computer vision" B.M ter Haar Romeny (ed.) , Kluwer Acad. Publ. (1994)</td></tr></
7 KB (994 words) - 15:30, 1 July 2020
...APL has always been controversial. At any rate, its influence on computer science, and especially on the development of programming languages, has been consi
...lign="top"> S. Wolfram, "Mathematica: A system for doing mathematics by computer" , Addison-Wesley (1988)</TD></TR></table>
5 KB (736 words) - 18:47, 5 April 2020
...olving geometric problems. Such problems can arise from computer graphics, computer-aided design, robotics and motion planning, cartography, etc. The disciplin
6 KB (957 words) - 17:46, 4 June 2020
...en Vickers ''Topology via Logic'' Cambridge Tracts in Theoretical Computer Science '''5''' Cambridge University Press (1989) {{ISBN|0-521-36062-5}} {{ZBL|0668
3 KB (527 words) - 07:33, 24 November 2023
A systematic application of the idempotent correspondence principle to computer calculations leads to a unifying approach to software and hardware design [
...p"> A.V. Aho, J.E. Hopcroft, J.D. Ullman, "The design and analysis of computer algorithms" , Addison-Wesley (1976)</TD></TR>
7 KB (1,079 words) - 20:39, 16 November 2023
...ws interesting analogies between paths in spaces and processes in computer science, and the applicability of a range of homotopical notions.
...imensional categories and concurrency in computer science" ''Math. Struct. Computer Sci.'' , '''10''' (2000) pp. 481–524</td></tr><tr><td valign="top">[a7]</
9 KB (1,441 words) - 17:45, 1 July 2020
If the behaviour of a computer program should be described formally --- this is necessary for e.g. the ve
...raic Specification", in J. van Leeuwen: "Handbook of Theoretical Computer Science", Elsevier 1990
6 KB (890 words) - 17:31, 7 February 2013
$#C+1 = 4 : ~/encyclopedia/old_files/data/C024/C.0204380 Computer, abstract,
A mathematical concept describing a model of a computer, while ignoring the bounded capacities of storage registers and other techn
9 KB (1,295 words) - 17:46, 4 June 2020
...on Automata, Languages, and Programming 90'' , ''Lecture Notes in Computer Science'' , '''443''' , Springer (1990) pp. 717–728</TD></TR><TR><TD valign="to
3 KB (541 words) - 12:32, 27 August 2014
...lized language|formalized language]] defined over a [[Signature (Computer Science)|signature]], a set of variables, and a logics. In this way, formulas are
...raic Specification", in J. van Leeuwen: "Handbook of Theoretical Computer Science", Elsevier 1990
9 KB (1,594 words) - 08:40, 20 May 2013
...he PRAM model has been widely used, especially by the theoretical computer science community, for designing and analyzing parallel combinatorial and graph-the
...eous resource bounds" , ''Proc. Twentieth Annual IEEE Symp. Foundations of Computer Sci., San Juan, Puerto Rico (1979)'' (1979) pp. 307–311</TD></TR></tabl
6 KB (940 words) - 23:19, 25 November 2018