profile picture

theory

What is a compiler

A compiler is a type of computer program that converts code written in a high-level programming language into machine code that can be executed by a computer. Essentially, it “compiles” the code into a form that the computer can understand and run. The process of compiling code can be broken down into several stages. The first stage is called lexical analysis, where the compiler breaks the code down into small, meaningful chunks called tokens.

Read more...

What is a transpiler

A transpiler, also known as a source-to-source compiler, is a type of computer program that converts code written in one programming language into another programming language. It essentially “transpiles” the code from one language to another, while maintaining the same functionality and behavior of the original code. One of the main benefits of using a transpiler is that it allows developers to take advantage of the features and capabilities of different programming languages, without having to completely rewrite their code.

Read more...

What is the linux kernel and differences to userspace

The Linux kernel is the heart of the Linux operating system. It is the low-level software that controls the communication between the computer’s hardware and the software that runs on top of it. The kernel is responsible for managing the system’s resources, such as memory, processors, and storage devices, and providing a stable and secure environment for other software to run on. One of the main differences between the Linux kernel and user space is that the kernel runs in what is known as privileged mode, while user space runs in unprivileged mode.

Read more...

Completness and satisfiability

The P vs NP problem is one of the most famous open problems in theoretical computer science. At its core, it asks whether or not all problems whose solutions can be verified in polynomial time, can also be solved in polynomial time. The class of problems that can be solved in polynomial time is called P, while the class of problems whose solutions can be verified in polynomial time is called NP.

Read more...