Search results

Jump to navigation Jump to search
Results 1 – 21 of 39
Advanced search

Search in namespaces:

View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • [[Category:Works by Edsger W. Dijkstra]] ...
    86 bytes (12 words) - 05:50, 29 April 2025
  • {{Short description|1988 paper by E. W. Dijkstra}} ...Science'''" is a 1988 [[scholarly article]] by [[Edsger W. Dijkstra|E. W. Dijkstra]]<ref>{{Cite EWD|1036|On the Cruelty of Really Teaching Computing Science}} ...
    4 KB (581 words) - 05:50, 29 April 2025
  • ...es are sufficiently similar to the one presented that proving them follows by essentially the same logic.<ref>{{cite book|first1=Gary|last1=Chartrand|aut ...by interchanging ''x'' and ''y'': ''y'' ≤ ''x'' ⇒ ''P''(''y'',''x''), and by symmetry of ''P'', this implies ''P''(''x'',''y''), thereby showing that '' ...
    4 KB (646 words) - 05:53, 19 May 2025
  • ...k | author-link=Jim Woodcock | title=Theories of Programming: The Life and Works of Tony Hoare | date=October 2021 | pages=285–316 | doi=10.1145/3477355.347 ...ariable names denoting the attributes of the paradigm that can be observed by an external entity; ...
    9 KB (1,173 words) - 10:26, 13 June 2025
  • ...:Thomas Carlyle by Robert Scott Tait 31 July 1854.jpg|thumb|Thomas Carlyle by Robert Scott Tait, 31 July 1854]] ...esolate and, indeed, quite abject and distressing one; what we might call, by way of eminence, the ''dismal science''."<ref>Carlyle, Thomas (1849). [http ...
    8 KB (1,269 words) - 15:03, 22 February 2025
  • | name = Edsger W. Dijkstra | image = Edsger Wybe Dijkstra.jpg ...
    47 KB (6,755 words) - 14:58, 27 October 2025
  • ...on models to assist large Dutch engineering projects, such as the [[Delta Works]]. During this early period, the Mathematics Institute also helped with des ...therlands, was the director of the institute for almost 20 years. [[Edsger Dijkstra]] did most of his early influential work on algorithms and formal methods a ...
    14 KB (1,803 words) - 16:04, 8 February 2025
  • ...ich was one of the original foundations of graph theory when it was solved by [[Leonhard Euler]] in 1736.<ref>Euler, Leonhard (1736). "Solutio problemati ...h is not of relevance here), and the analysis of transport networks. Early works, such as Tinkler (1977), focused mainly on simple schematic networks, likel ...
    13 KB (1,789 words) - 12:37, 27 June 2024
  • ...tion where strict inequality (<) should have been used, or vice versa. Off-by-one errors also stem from confusion over [[zero-based numbering]]. ...here? An intuitive answer may be {{nowrap|''n'' − ''m''}}, but that is off by one, exhibiting a [[#Fencepost error|fencepost error]]; the correct answer ...
    10 KB (1,471 words) - 13:00, 13 June 2025
  • ...ce, a ''zeroth derivative'' of a function is the function itself, obtained by [[derivative|differentiating]] zero times. Such usage corresponds to naming ...n-time]] [[indirection lookup]]s, so the indirection optimization provided by these arrays was done at compile time.<ref name="mikehoye"/> The optimizati ...
    24 KB (3,488 words) - 23:06, 17 October 2025
  • {{short description|In computing, restricting data to be accessible by one thread at a time}} ...n of a problem in concurrent programming control",<ref>{{cite journal|last=Dijkstra|first=E. W.|title=Solution of a problem in concurrent programming control|j ...
    18 KB (2,636 words) - 09:07, 29 July 2025
  • ...computing]].<ref>{{cite book| title=Theories of Programming: The Life and Works of Tony Hoare | date=2021 | editor-first1=Cliff B. | editor-last1=Jones | e ...ctions of concurrent processes, and along with [[Edsger W. Dijkstra|Edsger Dijkstra]], formulated the [[dining philosophers problem]].<ref name="ACM">{{ACM Por ...
    27 KB (3,570 words) - 02:22, 29 October 2025
  • Conditionals are typically implemented by selectively executing instructions. Although [[dynamic dispatch]] is not us ...tional ''expression'', having intrinsic value (e.g., it may be substituted by either of the values <code>True</code> or <code>False</code>) but having no ...
    38 KB (5,480 words) - 14:07, 24 May 2025
  • ...eously for different tasks doing different things. Another benefit is that by providing [[Reentrancy (computing)|reentrancy]], [[Recursion (computer scie ...nient to allocate space for this use by simply moving the top of the stack by enough to provide the space. This is very fast when compared to [[dynamic m ...
    26 KB (4,118 words) - 16:39, 2 June 2025
  • ...the disambiguation page [[Von Neumann]] — you will see that every article works that way. --> ...raft of a Report on the EDVAC]]'',<ref name ="FirstDraftReport" /> written by [[John von Neumann]] in 1945, describing designs discussed with [[John Mauc ...
    35 KB (5,054 words) - 15:37, 21 May 2025
  • ...e ACM'' (Volume 9, number 8) in "President's Letter to the ACM Membership" by Anthony A. Oettinger.<ref>{{cite web |url=https://bertrandmeyer.com/wp-cont ...}}</ref> It is also associated with the title of a NATO conference in 1968 by Professor [[Friedrich L. Bauer]].<ref>{{cite web ...
    60 KB (8,010 words) - 12:48, 17 November 2025
  • [[File:TUe by night.png|thumb|300px|left|TU by night]] ...s founded as the ''Technische Hogeschool Eindhoven'' (THE) on 23 June 1956 by the Dutch government. It was the second institute of its kind in the [[Neth ...
    40 KB (5,277 words) - 10:51, 13 September 2025
  • ...ow is closely related to code structure. Control flows along lines defined by structure and the execution rules of a language. This general concept of st ...ifier]], usually appearing at the start of a line and immediately followed by a colon. For example, the following C code defines a label {{code |Success} ...
    52 KB (7,292 words) - 06:40, 6 November 2025
  • In architecture, Alexander's work is used by a number of different contemporary architectural communities of practice, i ...ed to Margaret Moore Alexander, and he had two daughters, Sophie and Lily, by his former wife Pamela Patrick. Alexander held both British and American ci ...
    43 KB (5,924 words) - 23:30, 11 October 2025
  • ...numbers and how well they can be [[Diophantine approximation|approximated by rational numbers]], and investigated the properties of [[Weierstrass functi ...Charles University with a dissertation on [[Bessel function]]s supervised by Petr,<ref name="ped"/> then returned to Charles University as Petr's assist ...
    20 KB (2,846 words) - 23:44, 18 January 2025
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)