On Russel's Paradox
Russel's paradox is defining "the set of all sets that don't contain themselves". You can show that such construct leads to a contradiction. Read the wiki link for details. I started this article as a...
Tag
#Computer Science
Explore (search, categories, archive)
Data Consistency in Distributed system - CAP, PACELC and more
A trilogy about Data Consistency and how to workaround the CAP and PACELC theorems:1. First issues with multi-region and multi-cloud software scalability2. Solutions to have enough Consistency without...
3. Data Consistency and the "Theory of relativity"
moved to https://software.mihvoi.ro/2026/04/3-data-consistency-and-theory-of.html"If a tree falls in a forest and no one is around to hear it, does it make a sound?"If a system has an inconsistency bu...
2. Flow consistency - read-your-writes consistency
moved to https://software.mihvoi.ro/2026/04/2-flow-consistency-read-your-writes.html2. Consistency, Availability and low Latency in Distributed system (workarounding the CAP/PACELC theorems)Introduct...
1. Cache and Data Consistency in Distributed systems (CAP/PACELC/CRDT)
moved to: https://software.mihvoi.ro/2026/04/1-cache-and-data-consistency-in.htmlAbstract There is always a tension between data Consistency and system Availability when Partitioning a system across d...
Linux Ubuntu 19.04 full install on USB stick - fix UEFI/Grub
Even better reads:Data Consistency in Distributed System - CAP, PACELCMy Secular Philosophy - Life, God, Knowledge, Morality, EthicsThis blog is mainly focused on my Philosophical and theoretical idea...
Linux Grub/UEFI boot system - introduction / howto for Ubuntu 19.04
Better read: Data Consistency in Distributed System - CAP, PACELCThis blog is mainly focused on my Philosophical and theoretical ideas.From time to time I have practical posts that are too few to dese...
Why Kolmogorov complexity is not computable - root cause
Please check my informal introduction to "Kolmogorov complexity" if you are not familiar with the subject. In this article I will approach some less discussed ramifications of it and hopefully some ne...
Kolmogorov complexity - short, informal introduction
I want to give you an intuition about Kolmogorov complexity, without being very formal. Basically, Kolmogorov complexity defines a measure of how small can you compress a certain string of characters....
P=NP is undecidable (conjecture)
"P equals NP?" is a million dollars unsolved problem. Introduction "P" is the class of problems where we have algorithms that solves the problem in polynomial time. "NP" is the class of problems havin...