Three problems computers will never solve

Three problems computers will never solve

Modern computers seem like they can do just about anything but is that true are where problems that computers  jusy cannot solve i don't mean like willl computers never feed the world or tell those a joke  as  knows  other things we actually know for certain that computers will never be able do turns out yeah will  a computer program runforce or willl it eventually  stop it may seem like a simple question and for some  tyoe of  programs it's simple to answer yes or ni but there's no fool proof method that can make any given program and always tell you wheather it will keep running eventually stops this is known as the halting problems and in 1936 british mathematician alan turing proved that it was undecjdable a question no computer could ever answer to do that he had to invent the idea of a turing machine a theoretical device that reads instruction off of paper tape and computer according to a few simple rules turing showed that turing machines could never solve the halting problems and since every modern computers is basically a turing machine they can not either the reason you can carry arround tons of photos on your phone is compression  allows computerers take a photo or music or video file and make it smaller without reducing the quality but how small can a actually get turns out it's impossible to no compression depend on  how complex a file is so far example this sequenceof letter(abcdefg ) is less complex than this sequence (c4fivyno8jo9h) because we can find  a way to compress it into a statement that uses fewer letters in the original but this one can't really be simplyfied any  further this measure how simpler or complex something is called kolmogorov complexity and like the halting problemd it's undecidable which means you can neve have a program that can perfectly compressany given file these are called way tiles you arrange them on a grid like this to create solid colored squares any if you than do it so that all the edge of colour match on out to infinity that's called tilling the plane so the question is will any given set of long tiles tile the plane by now you can probably  guess the answer is there no way to know there can be  no method that can take any given set and decide whether or not it tiles the plane and since there's no method  there can alsk be no computer program to solve it  if's not just like these three problem would i do not know take longer than the lofe of the universe to compute to solve them a computer would have to an infinite number of steps in a finite time and no one knows if that's even physically possible to do but there is a project underway right now to find out and if it suceeds we might find ourselves on the verge of a whole new era of computing