The logic of ADHD : a brief review of fallacious reasoning

This paper has two central purposes: the first is to survey some of the more important examples of fallacious argument, and the second is to examine the frequent use of these fallacies in support of the psychological construct: Attention Deficit Hyperactivity Disorder (ADHD). The paper divides 12 familiar fallacies into three different categories—material, psychological and logical—and contends that advocates of ADHD often seem to employ these fallacies to support their position. It is suggested that all researchers, whether into ADHD or otherwise, need to pay much closer attention to the construction of their arguments if they are not to make truth claims unsupported by satisfactory evidence, form or logic.

3-D reconstruction of an ancient Egyptian mummy using X-ray computer tomography

Computer tomography has been used to image and reconstruct in 3-D an Egyptian mummy from the collection of the British Museum. This study of Tjentmutengebtiu, a priestess from the 22nd dynasty (945-715 BC) revealed invaluable information of a scientific, Egyptological and palaeopathological nature without mutilation and destruction of the painted cartonnage case or linen wrappings. Precise details on the removal of the brain through the nasal cavity and the viscera from the abdominal cavity were obtained. The nature and composition of the false eyes were investigated. The detailed analysis of the teeth provided a much closer approximation of age at death. The identification of materials used for the various amulets including that of the figures placed in the viscera was graphically demonstrated using this technique.

Three-dimensional reconstruction of an ancient Egyptian mummy

A complete series of cross-sectional computed tomography (CT) scans were obtained of a mummy of an Egyptian priestess, Tjenmutengebtiu, (Jeni), who lived in the twenty-second Dynasty (c. 945-715 BC). The purpose of this joint British Museum and St. Thomas’ Hospital project was effectively to ‘unwrap’ a mummy using cross-sectional X-rays. Jeni is encased in a beautifully decorated anthropomorphic cartonnage coffin. The head and neck were scanned with 2mm slices, the teeth with 1mm slices and the rest of the body with 4 mm slices, a 512 x 512 matrix was used. The 2D CT images, and 3D surface reconstruction’s, demonstrate many features of the embalming techniques and funerary customs of the XXII Dynasty. The presence of cloth protruding from the nasal cavities into the otherwise empty cranial cavity indicates that the brain was extracted via the nose. The remains of the heart can be seen as well as four organ packs corresponding to the mummified and repackaged lungs, intestines, stomach and liver. Each of the organ packs encloses a wax figurine representing one of the four sons of Horus. The teeth are in very good condition with little signs of wear, which, considering the gritty diet of the Egyptians, indicates that Jeni must have been very young when she died. A young age of death is also suggested by analysis of the shape of the molar teeth. The body is generally in very good condition demonstrating the consummate skill of the twenty-second Dynasty embalmers.

Unwrapping an ancient Egyptian mummy using x-rays

This article describes a project to unwrap an ancient Egyptian mummy using X-ray computed tomography (CT). About 600 X-ray CT images were obtained through the mummified body of a female named Tjetmutjengebtiu (or Jeni for short), who was a singer in the great temple of Karnak in Egypt during the 22nd dynasty (c. 945-715 BC). The X-ray CT images reveal details of the remains of body organs, wrappings and jewellery. 3D reconstructions of Jeni’s teeth suggest that she was probably only around 20 years old when she died, although the cause of death cannot be ascertained from the CT scans. The CT images were used to build a 3D model of Jeni’s head which enabled an artist to paint a picture of what Jeni may have looked like during life. A PowerPoint presentation and movie clips are provided as supplementary material that may be useful for teaching.

Some applications of logic to feasibility in higher types

While it is commonly accepted that computability on a Turing machine in polynomial time represents a correct formalization of the notion of a feasibly computable function, there is no similar agreement on how to extend this notion on functionals, that is, what functionals should be considered feasible. One possible paradigm was introduced by Mehlhorn, who extended Cobham's definition of feasible functions to type 2 functionals. Subsequently, this class of functionals (with inessential changes of the definition) was studied by Townsend who calls this class POLY, and by Kapron and Cook who call the same class basic feasible functionals. Kapron and Cook gave an oracle Turing machine model characterisation of this class. In this article, we demonstrate that the class of basic feasible functionals has recursion theoretic properties which naturally generalise the corresponding properties of the class of feasible functions, thus giving further evidence that the notion of feasibility of functionals mentioned above is correctly chosen. We also improve the Kapron and Cook result on machine representation.Our proofs are based on essential applications of logic. We introduce a weak fragment of second order arithmetic with second order variables ranging over functions from NN which suitably characterises basic feasible functionals, and show that it is a useful tool for investigating the properties of basic feasible functionals. In particular, we provide an example how one can extract feasible programs from mathematical proofs that use nonfeasible functions.

Mind change complexity of learning logic programs

The present paper motivates the study of mind change complexity for learning minimal models of length-bounded logic programs. It establishes ordinal mind change complexity bounds for learnability of these classes both from positive facts and from positive and negative facts. Building on Angluin’s notion of finite thickness and Wright’s work on finite elasticity, Shinohara defined the property of bounded finite thickness to give a sufficient condition for learnability of indexed families of computable languages from positive data. This paper shows that an effective version of Shinohara’s notion of bounded finite thickness gives sufficient conditions for learnability with ordinal mind change bound, both in the context of learnability from positive data and for learnability from complete (both positive and negative) data. Let Omega be a notation for the first limit ordinal. Then, it is shown that if a language defining framework yields a uniformly decidable family of languages and has effective bounded finite thickness, then for each natural number m >0, the class of languages defined by formal systems of length <= m: • is identifiable in the limit from positive data with a mind change bound of Omega (power)m; • is identifiable in the limit from both positive and negative data with an ordinal mind change bound of Omega × m. The above sufficient conditions are employed to give an ordinal mind change bound for learnability of minimal models of various classes of length-bounded Prolog programs, including Shapiro’s linear programs, Arimura and Shinohara’s depth-bounded linearly covering programs, and Krishna Rao’s depth-bounded linearly moded programs. It is also noted that the bound for learning from positive data is tight for the example classes considered.

Fuzzy logic power system stabilizer in multimachine stability studies

Power system stabilizers (PSS) work well at the particular network configuration and steady state conditions for which they were designed. Once conditions change, their performance degrades. This can be overcome by an intelligent nonlinear PSS based on fuzzy logic. Such a fuzzy logic power system stabilizer (FLPSS) is developed, using speed and power deviation as inputs, and provides an auxiliary signal for the excitation system of a synchronous motor in a multimachine power system environment. The FLPSS's effect on the system damping is then compared with a conventional power system stabilizer's (CPSS) effect on the system. The results demonstrate an improved system performance with the FLPSS and also that the FLPSS is robust

Fuzzy logic traffic control at a road junction with time-varying flow rates

Fuzzy logic has been applied to control traffic at road junctions. A simple controller with one fixed rule-set is inadequate to minimise delays when traffic flow rate is time-varying and likely to span a wide range. To achieve better control, fuzzy rules adapted to the current traffic conditions are used.