Mountain bases can support a lot. Everest is not terribly tall from its base, true, but Denali is 5500 meters from base to top and Mauna Kea rises to 10000 meters over base.
Its also a bit of an incorrect picure to think of the interior magma as a liquid. It can flow, but it can also sieze up or crack. Its an in-between, like corn starch and water.
What we see now are the ancient roots. Before the continental colision, there was a sea and subduction zone. This gave us sandstones, diorite, and granite… All of which were crushed at incredible pressure and temperature by the continental collision. At the deep roots of the mountains, this transformed the rock into gneiss, marble, and other extremely hard rock. Additionally, the forces were so great that the very bottom melted and became fresh granite.
All of these stones are very hard and resistant to erosion, and are what we see todayas the Appalachians
Its indirectly gravity. The taller the mountain, the more eroding force can be pleced on it. Water travels faster and therefore cuts deeper.
Everest is still uplifting fairly quickly at 1mm a year, but its also eroding at roughly the same pace and won’t get significantly taller than it is now. The same is true for the rest of the Himalaya as well, the whole range is eroding at a very high pace.
The Himalaya are home to some very spectacular canyons, including the largest canyon above water. The geology there is on full display and incredible.
I have started daydreaming of a career change to geology. There are just so many unanswered questions and its not like space or physics were these questions are tinyor super far away. You can just walk upto a geologic puzzle and hit it with a hammer.
Small? The Appalachians today are the resting skeleton of a mountain range so tall and enduring that the mud and sand that washed off them piled miles high and formed the Catskill mountains. The Appalachians were so mighty that their garbage formed mountains
One nit, pangea wasn’t the first supercontinent, we know of at least two, maybe three before it. The stone of the Adirondak mountains was formed as part of the Grenville mountains, which were built by a suprecontinent 1.5 billion years ago (the adirondaks got tall be’ause of a much more recent, unrelated thing, but their stone is very old). The Grenville runs from Hudson Bay to Texas
Completely unrelated. North and south america wern’t attached when the appalachians were tall. The Andes are formed by an ocean plate (the Nazca plate) dragging as it is sucked under south america. They are tall, and still growing taller.
The entire exeption, and the broader exclusionary rule, is based around the self-evidently incorrect assumption that what happens in court will effect behaviour of investigators.
the Isreali government has a long and increasing history of systematic oppression of palestinian people, both inside and outside of the occupied palestinian territories. amnesty.org/…/report-israel-and-occupied-palestin…
in computer science, we talk about a mathematical construct called a machine. Different kinds of machines can solve different problems, and the turing machine is the most powerful. It can solve any problem that can be solved by a machine.
Turing machines operate one step at a time, with each step taking the same amount of time. The total number of steps it takes to solve a problem is the time, of that machine.
Some problems have a fixed number of inputs, like “list all the states”. These machines have a fixed time. We call this constant time.
Others can have a variable number of inputs, like add up an arbitrary list of numbers. The longer the list is, the longer this takes.
An interesting, and important question is, how fast does the time of a machine go up as we add more inputs?
There are to major groups: the machines were the time goes up in a polynomial way (called P) and the ones were it goes up faster (called NP for non-polynomial). This means, for some machines, you can describe the time with an equation like time=inputs^n where n is any number.
A conjecture is that actually, all problems (that can be solved ) have a machine that can do in P time, thus all NP problems are actually P problems if we find the right machine.
This is important because much of our secret codes and other inportant things that we use today rely on those NP problems, which are really hard to solve. But if it turns out that they are P problems after all, there can be easy solutions.
Agreed. The function of the down vote is to deprioritize that post/comment. People should use the down vote when they want to deprioritize that post/comment.