About

I am Dimitri Tabatadze (also known as Taraxacum), and this beautiful website is supposed to be my personal portfolio. I may also write blog-like things here and there. Anyways!

I am a year old CS student based in Georgia. I like working with Rust, C/C++ and other low level programming languages. I like tinkering with hard problems, like landing rockets propulsively, or using quantum wave function collapse algorithm for generating ugly christmas sweater patterns!

I am very much interested in mathematics, spaceflight, playing / making video games, and writing code.

Education

I am currently in my 4th year of computer science bachelors at Kutaisi International University. I am also doing a minor in mathematics. My cumulative GPA up to present is 3.68.

Work Experience

I am currently a full Stack Engineer at NCER (the National Center for Educational Research). I'm working on an open source assessment system pipeline for Georgian schools.

I was a Student Assistant at KIU in Numerical Linear Algebra and in Theory of Computation for one semester each.

Before university, I went through a 3 month trial period Creative Junior Developer at glitch.ge. There, I worked on web games in JS/TS using phaser.js.

Life Goals

I present a list of goals for my life. I hereby promise to do everything in my power to keep moving towards these goals.

• Get a Ph.D.
• Make a music video with more than 10k views on youtube.
• Publish a book or a collection of stories I come up with during sleep.

Stranger Things

This is my collection of Stranger Things mini Funko pops that come with Kinder Joy.

Projects

• Recipes
• TRoLS
• cxrili
• ugly sweater collapse
• rocket sim
• 3D renderer using python turtle
• Simple raytracer

Games

I like playing games with friends. Some of the best couch co-op and versus games I've found:

• Make Way
• Cuphead
• Ultimate Chicken Horse

I've also made some games myself. They're not that good but here they are:

• Dash 'em
• purpy
• Weel the human

Contact Information

• Email: tabatadzedima@protonmail.com
• Github: D-T-666
• Matrix: @dimitrit:matrix.org

Friends

These are the people I would recommend for various things like hiring, collaborating or just hanging out.

• Maximillian Strand
• Ischa Abraham
• Demetre Lataria
• Sandro Lortkipanidze
• Lado Turmanidze
• Giorgi Otinashvili
• Erekle Khomasuridze
• Giorgi Nadareishvili
• Davit Maisuradze
• Mariam Katamashvili

Mathematics

In my free time I like to think about interesting math problems. Sometimes, I even come up with some of my own.

1. A problem about interpreting numbers in different bases

   Let $X$ be a subest of natural numbers not containing $1$. Let $a,b,c\in X$. If you were to write $a$ in base $b$ and then read that in base $c$, you'd get a number that's possibly not in $X$. Let's call the set of number obtained in such a way $\mathrm{repr}\left(X\right)$.

   The problem: find the set $X$ with minimal natural density $\mathrm{repr}\left(X\right)$ of which contains all natural numbers except $1$.

   My friend Ischa and I came up with this problem together. We had lots of fun with it.

2. A problem about projections of a hypercube.

   You are given a $n$ dimensional hypercube with all vertices painted the same color. You can pick any number of vertices and give them all unique colors. After that, the cube will be taken away, rotated into some orientation and put on a $n-2$ dimensional hyperplane so that only one face of the cube will be imprinted on the paper. After that, you will be shown the paper and you will have to be able to align the hypercube say what the orientation of the cube was when put on the paper. what is the minimum number of vertices you'll need to re-color to be able to tell the orientation every time?

3. A problem about cellular automaton.

   Automata has 7 states: $0$_i, 0_o, 0_c, 0_cc, 1_o, 1_c, 1_cc. In the table bellow, each row is for the The rules of an automaton are the following:

   	0i	Xo	Xc	Xcc
   0Y	0i	0o	1o	0c
   1Y	0cc	1c	0cc	1cc

   This automaton playes out in a 1D grid over time (like Wolfram's elementary CA). We will represent the grid as $a_n^{\left(t\right)}$ with $t$ denoting the cell number $n$ at timestep $t$. To find out the state of a cell $a_n^{\left(t\right)}$ you have to look at cells $a_{n-1}^{\left(t-1\right)}$ and $a_n^{\left(t-1\right)}$.

   $a_{n-1}^{\left(t-1\right)}$	$a_n^{\left(t-1\right)}$
   	$a_n^{\left(t\right)}$

   We set $$a_n^{\left(0\right)}=0,a_0^{\left(t\right)}=\{\begin{array}{ccc}{b}_t& \text{ if }& t\le \mathrm{C}\\ 0& \text{ if }& t>\mathrm{C}\end{array}$$ where $b\in {\{0,1\}}^C$ and $C\in \mathbb{N}$.

   We can visualize the run of this CA as a grid, where rows represent time steps and columsn represent the automata. Since we set the $0$-th cell to some fixed $b_t$, the first column of the said grid is going to be that exact sequence (for up to $C$ rows). Here's an interactive demo. You can click the cells in the first collumn to change $b_t$.

   The question is the following: For what sequence $b_t$ does the automaton have infinitely many rows indexed $n$ such that the number of $1$s in the rows $n,n+1$ and $n+2$ is greater than $1$.