I studied mathematics and computer science at the University of Bremen, Germany. I received my Master's degree in 2015 and PhD in 2019. From 2016 until 2022 I worked as a scientific employee at the University of Bremen, researching ontology-mediated query answering and description logics. I taught classed about theoretical computer science, automata theory, formal languages, computational complexity theory, algorithms and mathematical logic.
Since 2022, I work in the AI department of CONTACT Software, a PLM software company. My focus is on large language models (LLMs), semantic search, retrieval augmented generation (RAG) and data analytics.
I also have a YouTube channel about theoretical computer science.
NLogSpace is a term from computational complexity theory, a branch of theoretical computer science. There are some problem that computes can solve very efficiently, namely a logarithmic amout of space (memory), but on a nondeterministic machine. One example for such a problem is the reachability problem in direced graphs: Given a directed graph with a special start node a finish node, decide whether there exists a path from the start to the finish.
I have done a lot of research about problems in NLogSpace and I think it is a very interesting complexity class. That is why I chose this name for my website and my YouTube channel.
You can send me an email to kontaktnlogspacede, just insert two symbols at the correct positions.