So, there is something called a Turing machine, which is just a really, really, really simple computer. It has been proved that almost any math can be run on a Turing machine. Secondly, computers are just more complex turing machines- so a computer technically could be simplified down to a Turing machine- it would just be very large and slow.
Now, if a computer can be simplified into a turing machine, that means that everything a computer does can be done by a turing machine. Continuing this train of thought, if a turing machine were to be made in gimkit, that turing machine would be capable of all the math a normal computer is.
This means that anything that runs on a computer can be made in Gimkit.
Now, how do we know gimkit is turing complete? Well, we make a turing machine in it! I didn’t set out to do this originally, so rather than make a turing machine, I wrote a processer for a language called Brainduck. However, since Brainduck is turing complete (You can write a turing machine in brainduck), that means that you can make a turing machine in gimkit, and therefore the entire capability of a modern day computer is at your fingertips.
So, in conclusion, any code that can run on a modern computer can be run in gimkit, and so therefore, nothing is impossible.