Force of summation

A tétel rövid nézete
dc.contributor.authorGregorics, Tibor
dc.date.accessioned2024-09-04T09:47:04Z
dc.date.available2024-09-04T09:47:04Z
dc.date.issued2014-12-01
dc.description.abstractProgramming theorems are important tools of programming methodology. By using analogous programming techniques, the solutions of different tasks can be created easily and fast based on programming theorems. Perhaps the summation is the simplest programming theorem that is widely-known among the programmers but once and for all the most various tasks can be solved by this theorem. The aim of the present paper is to investigate the summation programming theorem. Several different abstract levels of this theorem will be defined and the problem types that can be solved based on summation are going to be described. We will underline those points of a programming theorem that make a theorem general and that are not defined in advance, just later during its application, when the solution of a problem is derived from the theorem.en
dc.formatapplication/pdf
dc.identifier.citationTeaching Mathematics and Computer Science, Vol. 12 No. 2 (2014) , 185-199
dc.identifier.doihttps://doi.org/10.5485/TMCS.2014.0365
dc.identifier.eissn2676-8364
dc.identifier.issn1589-7389
dc.identifier.issue2
dc.identifier.jatitleTeach. Math. Comp. Sci.
dc.identifier.jtitleTeaching Mathematics and Computer Science
dc.identifier.urihttps://hdl.handle.net/2437/379765
dc.identifier.volume12
dc.languageen
dc.relationhttps://ojs.lib.unideb.hu/tmcs/article/view/14955
dc.rights.accessOpen Access
dc.rights.ownerTibor Gregorics
dc.subjectanalogous programmingen
dc.subjectprogramming theoremen
dc.subjectenumeratoren
dc.titleForce of summationen
dc.typefolyóiratcikkhu
dc.typearticleen
Fájlok
Eredeti köteg (ORIGINAL bundle)
Megjelenítve 1 - 1 (Összesen 1)
Nincs kép
Név:
PDF
Méret:
468.42 KB
Formátum:
Adobe Portable Document Format
Letöltés
Gyűjtemények
Teaching Mathematics and Computer Science (DE-journals)