Skip to main content

My Linux Rice



My Linux distribution is EndeavourOS. I use the I3WM window manager. For the bar at the top, I use Polybar. In the bar in the leftmost place workplace number then (from left) there is a music visualizer using cava, volume, network, brightness, CPU, ram, battery, date, and systray icons. Also, there is a script going on in the bar which indicates an icon whenever the capslock is on or earphone or headphone is plugged in.

Along with this, I use Rofi as my launcher. It took a very long t theme my desktop but right now I am proud of this. As you can see I use Rofi (mainly) and also Dmenu for many menus - Clipboard, List of currently open applications, Opening a book, Editing config files, and for powermenu.


I also love using scratchpads. If you don't know what scratchpads are then it is a hidden window that you can easily call in front of you do some work on it and then you can make it hidden in the background. I have 4 scratchpads. One for cmus (command line music player), Bluetooth (basically for bluetoothctl), a normal terminal, and for my email client Thunderbird.

Finally comes the lock screen. I use Betterlockscreen for my lock screen. It is very cool and also you can dim or blur your picture on the lock screen. Also, you can customize this a little to make it look better. But otherwise, it is a very good minimal lock.



I can not show you the login screen. But I can tell you about it. I use sddm login manager with arcolinux-sddm-sugar-candy theme with my preferred wallpaper with it. You can access it from the GitHub link for all the dotfiles.
 

Now finally come one supreme thing. VIM !!! Many of you don't like it I know. Still, VIM is very good once you become better at it.

This is my VIM setup. It is actually NeoVim to be precise. I am using Tokyo Night theme. And my config is mostly written in Lua. I have added some plugins like one that shows git diff in the file while editing, one for autocompletion (coc.nvim), one to comment codes (nvim-commentary), etc. 

So that's it. This is all I have done to theme my desktop. It's not that good I know but still, it is special to me since I have built it from zero without copying. Here I have given the dotfile GitHub repo link and the wallpaper link.

Comments

Post a Comment

Popular posts from this blog

Hierarchy Theorems (Time, Space, Alternation)

There are many hierarchy theorems based on Time, Space, Nondeterminism, Randomization etc. Time Hierarchy Theorem (Version 1) : If $f, g$ are time-constructible functions satisfying $f(n) \log f(n)=o(g(n))$, then $$ DTIME(f(n)) \subsetneq DTIME (g(n)) $$ Proof:  Consider the following Turing machine $D$: "On input $x$, run for $f(|x|)\log (f(|x|))$ steps the Universal $TM$ $\mathcal{U}$ to simulate the execution of $M_x$ on $x$. If $\mathcal{U}$ outputs some bit $b \in\{0,1\}$ in this time, then output the opposite answer (i.e., output $1-b$ ). Else output 0.” Here $M_x$ is the machine represented by the string $x$.      By definition, $D$ halts within $f(n)\log (f(n))$ steps and hence the language $L$ decided by $D$ is in $DTIME(g(n))$. Claim:  $L \notin$ DTIME $(f(n))$ Proof:  For contradiction's sake, assume that there is some $TM$ $M$ and constant $c$ such that $TM$ $M$, given any input $x \in\{0,1\}^*$, halts within $cf(|x|)$ steps and outputs $D(x)$.      The time to si
1 comment
Read more

Function Automata: A Technique to Solve Finite State Automata Problems

Here I will describe a strategy or technique to solve some finite state automata problems. This strategy was first taught to us by my Theory of Computation Professor. The term 'Function Automata' is given to me since we use function-like structures in this.     Suppose you are given a language that is a regular set \(L\). So there exists a \(DFA\) for \(L\), \(L_D=(Q,\Sigma,\delta, q_1, F)\) where \(Q\) is the set of states, \(\Sigma\) is the set of alphabets, \(\delta\) is the transition function, \(S\) is the starting state and \(f\) is the set of final states. Now let \(Q=\{q_1,q_2,\dots,q_n\) where \(n\in\mathbb{N}\). Now we will do a kind of subset construction but every new state will have \(n\) states of \(Q\) but they can repeat. So $$(\underbrace{q_1,q_1,\dots,q_1}_{n\text{ times}})$$ is a state of the new automata. Now, what is the meaning of these new states? Let \(f=(q_{k_1},q_{k_2},\dots,q_{k_n})\) be a new state where \(q_{k_i}\)'s are not necessary to be diff
Post a Comment
Read more

Cook - Levin Theorem

Around 1971, Cook and Levin independently discovered the notion of \(NP-completeness\) and gave examples of combinatorial \(NP-complete\) problems whose definition seems to have nothing to do with Turing machines. Soon after, Karp showed that \(NP-completeness\) occurs widely and many problems of practical interest are \(NP-complete\). To date, thousands of computational problems in a variety of disciplines have been shown to be \(NP-complete\). \(SAT\) is the language of all satisfiable \(CNF\) formulae. Cook-Levin Theorem : \(SAT\) is \(NP-complete\) Before we go into the proof first we need to define some things Configuration of a Turing Machine: A configuration of a Turing Machine at any point of time \(t\) is basically the snapshot of the turning machine at that time. It is an ordered pair of the head position, current state, and tape content. Any configuration is initialized and ended with a special symbol, let \(\#\) mark its ending. Then the contents of the tape at the left of
Post a Comment
Read more