The Explanatory Role of Computation in Cognitive Science

Which notion of computation (if any) is essential for explaining cognition? Five answers to this question are discussed in the paper. (1) The classicist answer: symbolic (digital) computation is required for explaining cognition; (2) The broad digital computationalist answer: digital computation broadly construed is required for explaining cognition; (3) The connectionist answer: sub-symbolic computation is required for explaining cognition; (4) The computational neuroscientist answer: neural computation (that, strictly, is neither digital nor analogue) is required for explaining cognition; (5) The extreme dynamicist answer: computation is not required for explaining cognition. The first four answers are only accurate to a first approximation. But the ??devil?? is in the details. The last answer cashes in on the parenthetical ??if any?? in the question above. The classicist argues that cognition is symbolic computation. But digital computationalism need not be equated with classicism. Indeed, computationalism can, in principle, range from digital (and analogue) computationalism through (the weaker thesis of) generic computationalism to (the even weaker thesis of) digital (or analogue) pancomputationalism. Connectionism, which has traditionally been criticised by classicists for being non-computational, can be plausibly construed as being either analogue or digital computationalism (depending on the type of connectionist networks used). Computational neuroscience invokes the notion of neural computation that may (possibly) be interpreted as a sui generis type of computation. The extreme dynamicist argues that the time has come for a post-computational cognitive science. This paper is an attempt to shed some light on this debate by examining various conceptions and misconceptions of (particularly digital) computation.     

Renaming and the weakest family of failure detectors

We address the question of the weakest failure detector to circumvent the impossibility of $(2n-2)$ -renaming in a system of up to $n$ participating processes. We derive that in a restricted class of eventual failure detectors there does not exist a single weakest oracle, but a weakest family of oracles $\zeta _n$ : every two oracles in $\zeta _n$ are incomparable, and every oracle that allows for solving renaming provides at least as much information about failures as one of the oracles in $\zeta _n$ . As a by product, we obtain one more evidence that renaming is strictly easier to solve than set agreement.     

安全防护不容一丝轻忽—黑客入侵胰岛素泵的启发

不久前,我刚好有机会参加了一个医疗论坛,会议开幕演讲吸引了我的注意,因为会议上现场示范了如何以黑客手法侵入胰岛素泵。这场会议十分具有启发性,它让我们看到了黑客如何通过无线连接,从远端入侵存在安全漏洞的医疗设备。     

A novel, wideband, lithium niobate electrooptic modulator

A set of floating electrodes and a relatively thick buffer layer of low-dielectric constant is interspaced between the coplanar RF transmission line and the LiNbO₃ substrate containing the optical wave-guide structure. The composite structure is designed to feature a 50-Ω characteristic impedance, to have an effective dielectric constant equal to that of the optical wave for close velocity match, and to have a 3 dB bandwidth of 40 GHz. The purpose of the floating electrodes is to optimize the modulation sensitivity resulting in an improvement of about 6 dB. As a result, the RF power required for full modulation is lower than heretofore reported changing over the range from below 2 GHz to 20 GHz, from 44 mW to less than 70 mW. The close agreement between the theoretical and experimental values of the design parameters demonstrates the usefulness of the quasistatic assumption in the analysis of the composite structure