Algorithmic thinking and programming abilities of students is controversial popular issue in technological education programs schools universities. Students that have not best mathematical analytical background may difficulties learning computer programing. Moreover, highly difficult for a single individual to establish connection between discrete pseudo code algorithm source code. Another prob...

Algorithmic bias refers to systematic and structured errors in an artificial intelligence system that generate unfair results inequalities. This column discusses how algorithms appears, amplifies over time, shapes people’s thinking, potentially leading discrimination.

This research focuses on the stages of students' computational thinking processes in solving PISA questions about change and relationship content terms self-efficacy. The subjects this study were 15-year-old students class X MIPA 3 MAN 1 Semarang City, totaling 22 selected 2 who had high self-efficacy, moderate self-efficacy low method uses a qualitative descriptive approach. Data collection us...

In this paper, methods and concepts for algorithmic musical composition with flocking algorithms are discussed. Taking three pieces from an exhibition as examples, the strategies for building the specific relationships between each swarm-system and its musical results are shown. General considerations about the structures of self-organising systems and their potential for shaping musical dynami...

In the modern digital era, intensive efforts are made to inject computational thinking (CT) across science, technology, engineering, and mathematics (STEM) fields, aiming at formulating a well-trained citizenry workforce capable of confronting intricate problems that would not be solvable unless exercising CT skills. Focusing on contributing research area assessment in first two years primary s...

We review mathematical and algorithmic problems of reconstructing evolutionary features at ancestors in a known phylogeny. In particular, we revisit a generic framework for the problem that was introduced by Sankoff and Rousseau [“Locating the vertices of a Steiner tree in an arbitrary metric space,” Mathematical Programming, 9:240–246, 1975].