* [[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
...mber Theory, First Internat. Symp., ANTS-I'' , ''Lecture Notes in Computer Science'' , '''877''' , Springer (1994) pp. 1–16</TD></TR>
3 KB (516 words) - 17:58, 8 November 2014
...ithmic language]], into a language that can immediately be accepted by the computer. For certain mathematical models the translation problem has been solved ex
...ady compiled program is systematic execution, i.e. systematic testing on a computer and comparing the effects generated by the program with the expected effect
6 KB (989 words) - 14:54, 7 June 2020
...Sem. Random Graphs and Probabilistic Methods in Combinatorics and Computer Science, (Random Graphs '93; Poznań, 1993))</TD></TR>
10 KB (1,497 words) - 06:32, 26 March 2023
...on numerical methods; the main problem at that stage was to develop new, "computer-friendly" methods. In what follows the term "computational mathematics"
...matic programming|automatic programming]] the problems to be solved by the computer.
13 KB (1,892 words) - 20:11, 31 December 2018
...and moreover new method of studying them. This is the so-called method of computer simulation, which is intermediate between the classical deductive method an
...simple translation of the descriptions of the systems being modelled into computer codes. Special programs implementing the model generate the various concret
35 KB (5,424 words) - 11:17, 26 March 2023
...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 (533 words) - 20:21, 7 November 2023
...are the [[Semantics|semantical]] counterpart to the [[Signature (Computer Science)|signatures]], which are pure syntactical objects. In order to give the fu
...raic Specification", in J. van Leeuwen: "Handbook of Theoretical Computer Science", Elsevier 1990
13 KB (2,332 words) - 14:56, 21 April 2013
...ynamic programming|dynamic programming]], discrete-event systems, computer science, discrete mathematics, [[Mathematical logic|mathematical logic]], etc. (see
...V.P. Maslov, "Correspondence principle for idempotent calculus and some computer applications" J. Gunawardena (ed.) , ''Idempotency'' , ''Publ. I. Newton I
18 KB (2,598 words) - 22:11, 5 June 2020
1805. Computer algorithms implementing this variant of the $LAR$ procedure
...), International Encyclopedia of Statistical Science. Heidelberg: Springer Science +Business Media, LLC.
7 KB (1,015 words) - 19:42, 1 November 2023
Sparse matrices can be kept in the computer's memory in a compact form, in which only the non-zero elements and their p
.... Shamir, "The efficiency of the simplex method: a survey" ''Management Science'' , '''33''' : 3 (1987) pp. 301–334</TD></TR><TR><TD valign="top">[a4]
8 KB (1,246 words) - 06:35, 7 May 2022
...r representation and the way in which they are stored in the memory of the computer. For composite values like arrays (vectors, matrices) and structured values
...m (representation of the program in the internal language of some abstract computer, which is convenient for the subsequent processing or execution of the prog
12 KB (1,804 words) - 16:56, 7 February 2011
...young computer scientists, Smolenice, Oct. 1986'' , ''Lect. notes in comp. science'' , '''281''' , Springer (1987) pp. 138–168</TD></TR>
13 KB (1,968 words) - 18:43, 26 March 2023
...al designs in general, and Steiner systems in particular, e.g. in computer science and cryptography [[#References|[a19]]].
...P.C. van Oorschot, "Applications of combinatorial designs in computer science" ''ACM Comp. Surveys'' , '''21''' (1989) pp. 223–250</TD></TR></table>
32 KB (4,451 words) - 15:16, 19 March 2018
...utation, quantum algorithms and their complexity, and quantum control. The science of quantum information processing is a highly interdisciplinary field. In t
...the introspective approach which led to the basic definitions of computer science and information theory as formulated by A. Church, A.M. Turing, C. Shannon
21 KB (3,030 words) - 16:52, 1 July 2020
manually or with the aid of an electronic computer. Thus, in the [[travelling salesman problem]] (which is a typical discrete
...bility theory]], [[Operations research|operations research]], and computer science. A number of benchmark references from the Western literature is given belo
10 KB (1,391 words) - 12:30, 17 February 2021
...nd find applications in combinatorics (enumerative graph theory), computer science (automata) and system and control theory (representation of the input-outpu
6 KB (1,093 words) - 08:26, 16 March 2023
computer support seems to be mandatory {{Cite|AJS}},{{Cite|J}},{{Cite|LV1}},{{Cite|L
...72 " Computer analysis of Sprouts"], Carnegie Mellon University Computer Science Technical Report No. CMU-CS-91-144, May 1991
19 KB (3,145 words) - 10:05, 18 February 2021
...th.org/legacyimages/b/b120/b120080/b12008026.png"/>-complexity in computer science: a Bayesian view" J.M. Bernardo (ed.) , ''Bayesian Statistics'' , North-Ho
6 KB (908 words) - 18:44, 21 March 2024
...hm is one of the central ideas in [[Cybernetics|cybernetics]] and computer science.
In science, algorithms are encountered everywhere: a "general" solution to a problem
18 KB (2,796 words) - 19:10, 11 December 2020
...) > \operatorname { log } _ { 2 } n \}$, which often arises in computer science (as it did in [[#References|[a9]]]) as part of an analysis of algorithmic c
7 KB (994 words) - 16:46, 1 July 2020
...n (ed.) , ''Coding Theory and Applications'' , ''Lecture Notes in Computer Science'' , '''388''' , Springer (1989) pp. 193–201</TD></TR><TR><TD valign="to
7 KB (1,070 words) - 19:40, 5 June 2020
...simulated annealing, tabu search and GRASP" , ''Lecture Notes in Computer Science'' , '''980''' , Springer (1995) pp. 317–331</TD></TR><TR><TD valign="to
10 KB (1,422 words) - 08:14, 6 June 2020
...a theory in computer science is analogous to that of philosophy in general science: it constitutes the stem from which the individual branches of knowledge em
...valign="top"> A. Salomaa, "Jewels of formal language theory" , Computer Science Press (1981)</TD></TR><TR><TD valign="top">[a14]</TD> <TD valign="top"> A
28 KB (4,202 words) - 08:53, 1 February 2020
...Thayse, "Boolean calculus of differences" , ''Lecture Notes in Computer Science'' , '''101''' , Springer (1981)</TD></TR><TR><TD valign="top">[a7]</TD> <T
8 KB (1,166 words) - 06:28, 30 May 2020
...inspiration, D$0$L-sequences have turned out to be useful in areas such as computer graphics and simulation of biological developments, see [[#References|[a5]]
...zenberg (ed.) A. Salomaa (ed.) , ''Current Trends in Theoretical Computer Science. Essays and Tutorials'' , World Sci. (1993) pp. 586–594</TD></TR>
10 KB (1,542 words) - 11:21, 26 March 2023
...nics. And though the physical realization of a Turing machine, the digital computer, actually uses quantum mechanics, its construction principles aims at the s
...ch, "Quantum theory, the Church-Turing principle and the universal quantum computer", Proceedings of the Royal Society of London A400(1985)97-117
27 KB (4,213 words) - 18:53, 26 April 2014
...f quaternary sequences with low correlation" , ''Lecture Notes in Computer Science'' , '''388''' , Springer (1989) pp. 193–201</TD></TR></table>
6 KB (942 words) - 02:58, 18 May 2022
...e topos has recently been of considerable interest in theoretical computer science, since it contains "natural" models for the polymorphic [[Lambda-calculus|$
...l Foundations of Programming Language Semantics'' , ''Lect. notes in comp. science'' , '''298''' , Springer (1988) pp. 23–42 {{MR|0948482}} {{ZBL|0651.18004
10 KB (1,557 words) - 09:21, 1 May 2021
In queueing models of a wide variety of systems from computer, communication, manufacturing, and other areas of applications, birth and d
...recursive solution techniques. As queueing models in applications such as computer-communication and manufacturing systems became more complex the available m
20 KB (3,169 words) - 11:35, 3 April 2016
...zenberg (ed.) A. Salomaa (ed.) , ''Current Trends in Theoretical Computer Science, Essays and Tutorials'' , World Sci. (1993) pp. 586–594</td></tr><tr><t
7 KB (1,052 words) - 16:57, 1 July 2020
...ation]] numerical approximation methods are often used, using a high speed computer for the computation. The grid method (finite-difference method) is the most
...G.F. Pinder, "Numerical solution of partial differential equations in science and engineering" , Wiley (1982)</TD></TR>
18 KB (2,500 words) - 06:21, 12 October 2023
See also [[Computer, abstract|Computer, abstract]].
...ndom access machine (RAM) the memory consists of an infinite collection of computer words, each with an unbounded word-length, thus capable of storing arbitrar
18 KB (2,656 words) - 04:11, 6 June 2020
...city of the algorithm makes this method convenient for implementation on a computer. In linear programming a whole series of other finite methods have been dev
...ossibilities of computational algorithms and on the characteristics of the computer employed, such as the amount of memory, the speed, etc. To solve problems o
12 KB (1,882 words) - 22:25, 1 September 2016
...vide a very powerful tool in many applications, particularly communication science and coding theory.
...ithms and Error–Correcting Codes--AAECC-10'' , ''Lecture Notes in Computer Science'' , '''673''' , Springer (1993) pp. 257–268</TD></TR><TR><TD valign="top"
12 KB (1,769 words) - 08:31, 26 March 2023
...arrying out the corresponding computation and corresponding demands on the computer memory (see [[Minimization of the labour of calculation|Minimization of the
...portant not only because these problems often arise in diverse branches of science and technology, but because they frequently are a means for solving more ge
13 KB (1,891 words) - 13:06, 13 January 2024
...Distinguished Lecture to the Carnegie Mellon University School of Computer Science, Gregory Chaitin began his remarks as follows:<ref>Chaitin (2000), p. 12.</
...ttle bit of truth, that actually all of this that’s happening now with the computer taking over the world, the digitalization of our society, of information in
15 KB (2,329 words) - 14:32, 19 March 2023
...in practice one often prefers the simplicity of using general methods on a computer, rather than these possibilities.
....K. Banerjee, R. Butterfield, "Boundary element methods in engineering science" , McGraw-Hill (1981)</TD></TR><TR><TD valign="top">[8]</TD> <TD valign="t
9 KB (1,360 words) - 13:02, 13 January 2024
...in the 19th century. Evolving within the framework of capitalist economic science, the econometric direction uses its theoretical foundations, which restrict
...and control. Compared to the econometric trend in the capitalist economic science, the scientific direction followed in the USSR and the socialist countries
14 KB (2,040 words) - 19:36, 5 June 2020
Encyclopedia of Statistical Science. Heidelberg: Springer Science
Major advances are also being made in developing computer intensive methods
22 KB (3,172 words) - 20:20, 12 March 2016
...nite functions" J. van Leeuwen (ed.) , ''Handbook of Theoretical Computer Science'' , '''A''' (1990) pp. 758–804; Chap.14</td></tr><tr><td valign="top">[
9 KB (1,354 words) - 17:44, 1 July 2020
Vapnik–Chervonenkis classes have turned out to be useful in computer science (learning theory [[#References|[a1]]]), [[Probability theory|probability th
11 KB (1,646 words) - 12:43, 19 February 2021
...It is easy to multiply very large integers, whereas even the most powerful computer with the best known algorithm is incapable (within the lifetime of the univ
..., which points at two weak links: the existence of a password table in the computer and the threat of wire taps while the user enters his password.
35 KB (5,528 words) - 19:33, 19 January 2024
.../td> <td valign="top"> S.N. Burris, "Logic for mathematics and computer science" , Prentice-Hall (1998)</td></tr></table>
9 KB (1,433 words) - 17:00, 1 July 2020
...urs arising dynamically (i.e. at run-time) when executing a program upon a computer. A main application is to allow compilers to generate more efficient code b
...D.M. Gabbay (ed.) T.S.E. Maibaum (ed.) , ''Handbook of Logic in Computer Science'' , '''4''' , Oxford Univ. Press (1995) pp. 527–636</TD></TR><TR><TD va
18 KB (2,572 words) - 07:07, 26 March 2023
''Science'' in particular, consider the significance test as a criterion of scientifi
'' Science is inevitably about magnitudes.'' (Cohen, 1990, page 1309)
25 KB (3,645 words) - 10:19, 10 March 2024
...nd unambiguous computations" , ''Proc. 5th IEEE Symp. on Logic in Computer Science'' (1990) pp. 168–180</td></tr><tr><td valign="top">[a9]</td> <td valign
9 KB (1,426 words) - 19:09, 18 July 2020
binary codes and electronic switching in computer science. Since
9 KB (1,457 words) - 19:16, 24 March 2023
...ry definitions of programming language semantics" , ''Lect. notes in comp. science'' , '''42''' , Springer (1976)</TD></TR><TR><TD valign="top">[9]</TD> <TD
...rs of Hoare's logic, a survey, part II: nondeterminism" ''Theor. Computer Science'' , '''28''' (1984) pp. 83–109</TD></TR><TR><TD valign="top">[a3]</TD>
21 KB (3,241 words) - 08:25, 6 June 2020
...<TD valign="top">[12]</TD> <TD valign="top"> A. George, J.W.-H. Liu, "Computer solutions of large sparse positive definite systems" , Prentice-Hall (1981
13 KB (1,962 words) - 19:37, 5 June 2020
Some applications of computer science can be better modeled by a PTM than by a classical TM. An example are envir
12 KB (1,954 words) - 17:47, 26 December 2013
...ble computations" , ''Proc. 24th IEEE Symposium on Foundations of Computer Science'' (1983) pp. 439–445</TD></TR><TR><TD valign="top">[a2]</TD> <TD valign
14 KB (2,246 words) - 06:44, 26 March 2023
...arendregt, "Lambda calculi with types" , ''Handbook of Logic in Computer Science'' , Oxford Univ. Press (To appear (1990))</td></tr><tr><td valign="top">[a
15 KB (2,306 words) - 16:57, 1 July 2020
...y]]), [[Operations research|operations research]] and theoretical computer science. In this article, three important approaches to the description and analysi
14 KB (2,165 words) - 19:35, 5 June 2020
...ic programming" J. van Leeuwen (ed.) , ''Handbook of Theoretical Computer Science'' , Elsevier (1990) pp. 493–574</TD></TR><TR><TD valign="top">[a2]</TD>
15 KB (2,311 words) - 04:11, 6 June 2020
...#References|[a38]]]. Reasons for developing this theory, from the computer science viewpoint, are described in [[#References|[a42]]]. There are applications t
18 KB (2,710 words) - 00:41, 15 February 2024
are called nets; nets are used in computer science, cf. [[#References|[a29]]]).
..."> W. Reisig, "Petri nets" , ''EATCS Monographs on Theoretical Computer Science'' , '''4''' , Springer (1985)</TD></TR><TR><TD valign="top">[a30]</TD> <TD
57 KB (8,236 words) - 19:41, 20 January 2021
strategy, involving computer-based sampling and analysis at the
International Encyclopedia of Statistical Science.
20 KB (2,970 words) - 20:18, 12 March 2016
...mpressible gas imposes considerable demands on the speed and memory of the computer. In this case the application of explicit schemes yields simpler algorithms
...sufficiently fine grids. This is impossible, because of limitations on the computer memory, without the use of the method of mutually overlapping regions (see
23 KB (3,271 words) - 08:02, 6 June 2020
In the computer-science literature, cluster detection is also called unsupervised learning.
Encyclopedia of Statistical Science,
36 KB (5,856 words) - 18:32, 17 April 2024
...e-independent knowledge about the common-sense world or highly specialized science domains. In any case, a corresponding knowledge repository (ontology, domai
...be distinguished: systems which support natural language interaction with computer systems, either in a written or spoken mode (so-called natural language int
18 KB (2,627 words) - 17:03, 1 July 2020
...ue to three reasons: many control systems had been identified by classical science (to identify a control system means to write down its mathematical model, e
...mental evaluation of such solutions with the aid of an analogue or digital computer.
43 KB (6,618 words) - 07:32, 26 March 2023
...inverse problems that arise in physics, technology and other branches of science, in particular, problems of data processing of physical experiments, belon
...zing $M^\alpha[z,u_\delta]$, which can be solved by various methods on a computer (for example, by solving the corresponding Euler equation for $M^\alpha[z,
33 KB (5,246 words) - 00:23, 25 April 2012
...ition is defective, in as much as it assigns for the general object of the science, what can only be considered as one of its applications.
::the science which treats the combinations of arbitrary signs and symbols by means defin
189 KB (29,059 words) - 14:31, 19 March 2023