## Ville Salo

Ph.D., Postgraduate student

vosalo(at)utu.fi

University of Turku, Department of Mathematics and Statistics

If you have comments, complaints, suggestions or questions pertaining to my articles, or just feel like it, you can reach me via my university email.

### Main Mathematical Interests (in mostly random order)

- dynamical systems, mostly symbolic dynamics, subshifts, tiling systems and cellular automata.
- groups, automorphism groups, geometric group theory
- automata theory, picture-walking automata
- measure theory, ergodic theory, ergodic Ramsey theory
- general topology, algebraic topology, geometry, algebraic geometry
- universal algebra and lattice theory
- category theory, combinatorics, graph theory, descriptive set theory, recursion theory, complexity theory, matroids, vector spaces

### Writings Related to my Studies

- 2014
- My PhD Thesis: Subshifts with Simple Cellular Automata
- 200 pages
- supervisor Jarkko Kari
- Best Ph.D. Thesis in Computer Science in 2015 award from the Finnish Society for Computer Science

- My PhD Thesis: Subshifts with Simple Cellular Automata
- 2013
- IP = PSPACE
- with Ilkka Törmä, 18 pages
- written for the course Seminar on Algorithmic Complexity

- IP = PSPACE
- 2012
- The Paris-Harrington Theorem
- with Ilkka Törmä, 9 pages + 9 pages of python
- written for the course Ramsey Theory and Related Topics

- Known Theorems about Substitutions, and Homemade Proofs for Them
- with Ilkka Törmä, 7 pages
- written for a course on Substitutions

- The Paris-Harrington Theorem
- 2011
- On the Existence of Dense or Sparse NP-Hard Languages
- 6 pages
- written for the course Algorithmic Complexity

- My Master's Thesis:
Classes of Picture Languages Defined by Tiling Systems, Automata and Closure Properties
- 104 pages
- supervisor Jarkko Kari
- University of Turku graduate thesis of the year

- On the Existence of Dense or Sparse NP-Hard Languages
- 2010
- My Bachelor's Thesis:
Fully Polynomial Approximation Schemes for the Knapsack Problem
- in Finnish, "Täysin polynomiaikaisia approksimaatioalgoritmeja kapsäkkiongelmaan"
- 31 pages
- supervisor Olli Nevalainen

- My Bachelor's Thesis:
Fully Polynomial Approximation Schemes for the Knapsack Problem

### Teaching Activity

- Algoritminen matematiikka (Algorithmic mathematics), spring 2017.
- Johdatus automaattien teoriaan (Introduction to automata theory), spring 2017.

### Other Interests

- Programming and programming languages
- Game programming
- Implementing esoteric programming languages and programming in them

- Composing and playing technical death metal
- Learning natural languages and conlangs. I'm currently studying Russian and Japanese, know some Finnish, English, Spanish, German and Swedish, and am a big fan of Lojban.

There have been at least 13530 unique visitors by IP address.