However, the crux of the course is not about proving theorems, but to demonstrate the practices and visualization of the concepts. Thus we will not engage in precise deduction or notation, rather we ...

Not really sure why I started studying it again but I do know that foundations are key and sometimes just revisiting some old concepts might just be whats needed to move forward. Gilbert Strang's ...

20.4.2026 – 5.6.2026 After passing the course the student has obtained an understanding of the basic concepts of linear algebra. He/she has theoretical understanding of linear systems, least squares ...

We complete the example by showing how to represent regular expressions in linear logic. It is easy to show that for every string in the language of a regular expression, we can prove the ...

Abstract: The story behind the Euclidean algorithm and its relationship to the solution of the Diophantine equation is examined in this article. The Euclidean algorithm appears in Proposition 2 in ...