Philosophy of Everything

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 new ideas: an example of a Kolmogorov compression that would require an arbitrary high amount of working memory before shrinking to the compressed string (conjecture). 1. Root cause why "Kolmogorov complexity" is uncomputable Kolmogororov complexity is uncomputable because Turing machines have a halting problem :) Let's start with the observation the the Halting problem of a Turing machine having a limited band is actually decidable, unlike the infinite band one. A "finite band Turing machine" is actually a finite state machine that will either stop without going through the same state, or will cycle infinitely. Having a limited number of possible states, it cannot run too much without repeating a previous state. As soon as the machine returns to...

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. You can think about it like measuring how small can you make a file (string of characters) by compressing it with ZIP or similar. A file storing a very redundant information (like "aaaaaaaaaaaaaaaa....") can be compressed in a much smaller size compared with a random one. For calculating the "Kolmogorov complexity", the "compressed" form is considered to be something like a self-extract archive: the shortest program that can output the initial string of characters (the "file/string to be compressed"). The Kolmogorov complexity is more general and includes classical compressing algorithms. For example a Huffman code is not very powerful in compressing a string like "123456789101112131415161718192021222324..." (concatenated consecut...

P.S. To disable the"notifications" telling " Microsoft Edge is safer than Google Chrome" you should (it seems): Click on the Win10 icon (down-left) Write and choose: "Settings" System Notifications Turn "Off" the right notification switches. Not sure what switches are sufficient and what you might miss if put them all to "Off". Just read and try on your own judgement, no warranties. * * * This really got me angry. I was reading Facebook on my Chrome browser... laughing a bit on a joke telling that "If you ever feel useless, just remember that someone had to port Microsoft Edge on Android". Scroll a bit below, give some likes...

Reviews for gadgets I own Data Consistency in Distributed System - CAP, PACELC Morality series - a heptalogy Devices list: WD My Passport Portable Hard Drive 4TB, blue - WDBYFT0040BBL - 0A RASPBERRY PI MODEL B 3 Starter Kit with 32GB SD Card Case and 5 V 2.5 A Power Supply - Glob Mall Abox SUPERIOR BLAC Rii Mini I28 Wireless (QWERTZ) – Mini Keyboard Samsung Memory Card microSDHC Class High Speed Class 10 with SD Adapter, (2017 Model) - Evo Plus u3 SD Card UHS-II Lexar 1800x (32GB) (2019-06) SD Card Sandisk 200GB UHS-I that advertises 100MB/s SD Card Reader SanDisk USB 3.0 UHS-I - SanDisk SDDR-B531-GN6NN MobileMate (2019) SD Card Samsung EVO Plus, 128GB, UHS-I, advertised Read=100 MB/s, Write=90|MB/s

This is not about a specific flaw in Bitcoin, however Bitcoin is a preeminent exponent of the crypto-currency galaxy. Any cryptocurrency that don't have a sufficient loan base have these problems. Bitcoin, especially, looks more and more like a Ponzi scheme that is just ready to blow. Only that there will be no Charles Ponzi to sue, only a lot of people that lost money and a few winners that sold the bitcoins before the bang. Or, with another metaphor, Bitcoin is like a global poker game where some will take the pot and the others will bite the dust. It may happen tomorrow or after years, but for me this is the only reasonable end. Until then, everybody believes they have a very good hand... Here are my arguments: No loans, no value

I define intelligence as the capacity of one entity to create complex internal representations that can be used to predict about it's environment the likely outcome from a particular configuration or action, based on the regularities of the environment. Entity can be organic life form or (potentially) a natural or artificial inorganic intelligence. The "can be used" instead of "uses" also covers a case of "abstract only" entity that constructs purely theoretical abstract model (think mathematics) and does not use it for any adaptation purposes.

" 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 having solutions that can be proven in polynomial time once you "guess" the solution. This is analogous with the sorting problem: it's easier to check the correct sorting of a list than to actually sort a list. Of course, if you can fully solve the problem in polynomial time, you can also prove it in polynomial time, so P is included in NP. However, NP seems to contain some very hard problems that cannot be currently solved in polynomial time. It is believed that NP contains some problems that can never be possibly solved in P. I will not do a formal proof, more like an argument or a sketch. You might have more patience and skills to develop some of these ideas even if they might have flaws in the current form. You can take it a...