Incidences de la pensée philosophique de P. Ricœur sur la théologie contemporaine

Tout « ce qui » pense en théologie aujourd’hui a été plus ou moins marqué par la pensée philosophique de P. Ricœur. L’auteur de l’article montre comment l’im­portance accordée par celui-ci à l’épaisseur concrète des médiations a marqué son propre itinéraire de théologien de la liturgie et des sacrements. Il s’arrête sur un exemple précis, au croisement de l’intérêt de Ricœur pour le « texte », en particulier biblique, et de son propre intérêt de théologien de la liturgie pour la « Parole de Dieu » : celui de la « Bible liturgique ».Every contemporary theological reflection bears the mark of Ricœur’s philosophical thought in some way. His idea of the importance of the “concrete thickness” of mediations greatly influenced the author of this article along his path as a sacraments and liturgy theologian.Alles was zur Zeit in der Theologie denkt ist mehr oder weniger vom philosophischen Denden Ricœurs beeinflusst. Der Autor zeigt was er ihm als Theologe der Liturgie und der Sakramente verdankt

TRS-80 With A Keccak Sponge Cake

The subject of this paper, an improbable implementation of a recently standardized cryptographic hash function on a thirty-five-year-old microcomputer, may strike some as unusual and recreative at best. In the tedious discipline of the process, however, lessons were learned in implementation trade-offs for basic cryptographic primitives which may prove interesting in the current context of securing (small to nano) machine to machine communications. More importantly, that such insights might stem out of revisiting how earlier computing platforms relate to the code written on them to cast a distant light on modern connections of code to material, historical and contextual factors certainly illuminates the joys of retrocomputing

Gimli, Lord of the Glittering TRS-80

Bernstein et al. have proposed a new permutation, Gimli, which aims to provide simple and performant implementations on a wide variety of platforms ranging from the AVR ATmega and ARM-Cortex to the Intel Haswell. In a festive spirit of retrocomputing, this brief paper reports such a simple and (somewhat) performant implementation on the almost Third-Age-of-Middle-earth-dating TRS-80

The PERT Problem with Alternatives: Modelisation and Optimisation

Management of projects often requires decisions concerning the choice of alternative activities. The completion time of the whole project (i.e. the makerpan) is computed subsequently. In this paper, we aim at selecting the activities and computing the makespan simultaneously. This problem is referred to as PERT Problem with Alternatives (PPA). The corresponding model is similar to a conventional PERT graph, except that two types of nodes are introduced to represent either the choice between activities, or the fact that a set of activities should be completed before starting a subsequent set of activities. In this paper, we analyse the PPA and we propose a pseudo-polynomial algorithm to solve it