Posts

Short essays, ideas, events, notes

Talk on finite computational structures

Here are the slides for my talk “Finite Computational Structures and Implementations” for the The 4th International Symposium on Computing and Networking CANDAR’16 held in Hiroshima, Japan, November 22-25, 2016.

The photo was taken in the Higashi Hiroshima Arts and Culture Hall, the venue of the conference.

Digital Studies Hackathon at AIU

Teaching, digitally disrupted (PDF) mini keynote and Hackathon guidelines (PDF) in general and for curriculum design in particular. These documents were prepared for the Digital Studies Hackathon Event at Akita International University, 2016 November 26. http://www.aiu-digitalstudies.org/

Publications

Peer reviewed journal papers, book chapters, conference proceedings

On the atoms of algebraic lattices arising in $q$-theory

We determine many of the atoms of the algebraic lattices arising in ${q}$-theory of finite semigroups.
IJAC International Journal of Algebra and Computation (accepted)

Finite Computational Structures and Implementations

What is computable with limited resources? How can we verify the correctness of computations? How to measure computational power with precision?
CANDAR’16, Fourth International Symposium on Computing and Networking, Hiroshima, Japan, November 22-25, 2016

Teaching

Due to the rapid changes in our technological societies the aims of teaching and the teaching process itself need to be rethought again and again. The response is twofold: 1. fast moving, rapidly deployed courses and 2. focusing on core knowledge versus ephemeral ideas and technologies. The challenge is that these two requirements might be in conflict.

Currently I teach at Akita International University.

Courses I designed

• Poetry of Programming - puzzle based introduction to functional programming (MAT245). Syllabus, tutorial notes draft.

• Mathematics for the digital world (MAT240 Mathematics behind the technological society). Syllabus

• Calculus (MAT250) Single variable calculus up to the Fundamental Theorem of Calculus. Syllabus

• College Algebra (MAT150) From set theory up to $e^{\pi i}+1=0$.

• Statistics (MAT200)

Previous courses

• Social Web Analytics

• Computational Complexity

• Discrete Mathematics

• Differential Calculus

• Semigroup Theory, Representation Theory (graduate courses)

• Formal Languages and Automata

• Linear Algebra

• Programming (C#)

• Design and Analysis of Algorithms

• Operating Systems, Shell Programming

• $\LaTeX$

• supervising MSc projects in Computer Science

• Artificial Life (guest lecture)

• Programming (C, Java)