Resources and textbooks for computer science education in French primary schools

This article examines a corpus of texts that define the scope and objectives of computer science (CS) education at primary school level in France, including textbooks, curricula, and institutional documents. Faced with these new programs, and in the absence of any specific training on methods for teaching computer science, teachers have had to make do by relying on a disparate set of documents ranging from prescriptive and guidance texts, official directives and curricula, institutional documents, text­books, and other books. This article provides an analysis of these documents from a computer science pedagogy perspective with the aim of exploring how they change and evolve through the grades of education. We begin with a transversal analysis to highlight changes in the content taught from one cycle to the next. Then, we focus on how a specific notion, the notion of loop, is introduced to students, in order to characterise how the same notion is formulated and evolves across the different textbooks. In this way, we show that loops are defined differently across textbooks, using vocabulary that is increasingly precise and connected to other areas of knowledge, without being always connected to the digital field

The Graph Motif problem parameterized by the structure of the input graph

The Graph Motif problem was introduced in 2006 in the context of biological networks. It consists of deciding whether or not a multiset of colors occurs in a connected subgraph of a vertex-colored graph. Graph Motif has been mostly analyzed from the standpoint of parameterized complexity. The main parameters which came into consideration were the size of the multiset and the number of colors. Though, in the many applications of Graph Motif, the input graph originates from real-life and has structure. Motivated by this prosaic observation, we systematically study its complexity relatively to graph structural parameters. For a wide range of parameters, we give new or improved FPT algorithms, or show that the problem remains intractable. For the FPT cases, we also give some kernelization lower bounds as well as some ETH-based lower bounds on the worst case running time. Interestingly, we establish that Graph Motif is W[1]-hard (while in W[P]) for parameter max leaf number, which is, to the best of our knowledge, the first problem to behave this way.Comment: 24 pages, accepted in DAM, conference version in IPEC 201

Intrinsically Universal Cellular Automata

This talk advocates intrinsic universality as a notion to identify simple cellular automata with complex computational behavior. After an historical introduction and proper definitions of intrinsic universality, which is discussed with respect to Turing and circuit universality, we discuss construction methods for small intrinsically universal cellular automata before discussing techniques for proving non universality

Dagstuhl News January - December 2002

"Dagstuhl News" is a publication edited especially for the members of the Foundation "Informatikzentrum Schloss Dagstuhl" to thank them for their support. The News give a summary of the scientific work being done in Dagstuhl. Each Dagstuhl Seminar is presented by a small abstract describing the contents and scientific highlights of the seminar as well as the perspectives or challenges of the research topic