Suckerpinch has a dive into his attempt to solve this problem too, which is a great way to see some of the software engineering involved in trying to solve this problem...
Suckerpinch has a dive into his attempt to solve this problem too, which is a great way to see some of the software engineering involved in trying to solve this problem
His whole channel is one of the most binge worthy on the platform for the right kinda nerd. Most of his videos are about making SIGBOVIK entries which are, "scientific discoveries that make you...
His whole channel is one of the most binge worthy on the platform for the right kinda nerd. Most of his videos are about making SIGBOVIK entries which are, "scientific discoveries that make you laugh, then think".
In the past, he's used a raspberry pi to see the limits of the nes hardware. A move only compiler, just endless ridiculous fun projects.
My personal favorite of his was the usage of network latency to make a storage medium, but everything he makes is fantastic for (like you say) a particular flavor of nerd.
My personal favorite of his was the usage of network latency to make a storage medium, but everything he makes is fantastic for (like you say) a particular flavor of nerd.
I was flabbergasted one day when my coworker casually mentioned how his friend from college used network latency as a storage mechanism. I blurted out “Your friend is Tom7?!?!”. The SF Bay Area...
I was flabbergasted one day when my coworker casually mentioned how his friend from college used network latency as a storage mechanism. I blurted out “Your friend is Tom7?!?!”.
The SF Bay Area really is a small world (and yes I know Tom himself is in Pittsburgh).
Just some fun geometry, and also an example of a computer assisted proof that required dividing a case into 18 million sub cases and checking them individually, ala the four colour theorem.
Just some fun geometry, and also an example of a computer assisted proof that required dividing a case into 18 million sub cases and checking them individually, ala the four colour theorem.
The latest busy beaver was similar. They found they could break it down to "just" thousands of cases and spend it think years tediously proving each case one by one. bbchallenge.org
The latest busy beaver was similar. They found they could break it down to "just" thousands of cases and spend it think years tediously proving each case one by one.
It's so interesting that there are problems in math that, if computers were never invented, or they were physically impossible, would be functionally impossible to answer. It makes me wonder if...
It's so interesting that there are problems in math that, if computers were never invented, or they were physically impossible, would be functionally impossible to answer.
It makes me wonder if there are some fundemental questions about the universe that will just always be out of reach to answer, because answering them requires some technology that the laws of physics just precludes from existing.
That's kinda the rub with string theory. It's the most robust theory of quantum gravity, the math (from a layman) all works and is logical, but none of it is even barely testable. The closest...
That's kinda the rub with string theory. It's the most robust theory of quantum gravity, the math (from a layman) all works and is logical, but none of it is even barely testable. The closest they've got is finding weird long structures and bubbles that could be better described with string theory but they are far, far, far from any smoking gun results.
The title is a bit inaccurate. It's specifically about convex polyhedra - not just shapes. A sphere (not a convex polyhedra) is trivially non-Rupert, and it's also pretty easy to come up with...
The title is a bit inaccurate. It's specifically about convex polyhedra - not just shapes.
A sphere (not a convex polyhedra) is trivially non-Rupert, and it's also pretty easy to come up with concave polyhedra that fail this test. As the polyhedra they work with become increasingly close to spherical, I suspect it's also becomes more likely that they cannot pass through themselves.
The article mentioned aliens. Maybe there's a whole category of math things that have no practical application whatsoever until we meet other species, and they'll recognize/categorize us along an...
The article mentioned aliens. Maybe there's a whole category of math things that have no practical application whatsoever until we meet other species, and they'll recognize/categorize us along an intelligence scale using these. Sort of like how we applaud parrots for fashioning tools and we like it when belugas like to scare toddlers for fun.
Suckerpinch has a dive into his attempt to solve this problem too, which is a great way to see some of the software engineering involved in trying to solve this problem
https://www.youtube.com/watch?v=QH4MviUE0_s
His whole channel is one of the most binge worthy on the platform for the right kinda nerd. Most of his videos are about making SIGBOVIK entries which are, "scientific discoveries that make you laugh, then think".
In the past, he's used a raspberry pi to see the limits of the nes hardware. A move only compiler, just endless ridiculous fun projects.
My personal favorite of his was the usage of network latency to make a storage medium, but everything he makes is fantastic for (like you say) a particular flavor of nerd.
Reminds me of this delightful story of yore
https://www.ibiblio.org/harris/500milemail.html
I was flabbergasted one day when my coworker casually mentioned how his friend from college used network latency as a storage mechanism. I blurted out “Your friend is Tom7?!?!”.
The SF Bay Area really is a small world (and yes I know Tom himself is in Pittsburgh).
Just some fun geometry, and also an example of a computer assisted proof that required dividing a case into 18 million sub cases and checking them individually, ala the four colour theorem.
The latest busy beaver was similar. They found they could break it down to "just" thousands of cases and spend it think years tediously proving each case one by one.
bbchallenge.org
It's so interesting that there are problems in math that, if computers were never invented, or they were physically impossible, would be functionally impossible to answer.
It makes me wonder if there are some fundemental questions about the universe that will just always be out of reach to answer, because answering them requires some technology that the laws of physics just precludes from existing.
There is actually a Quanta Magazine about just that:
Computer Scientists Prove That Certain Problems Are Truly Hard
That's kinda the rub with string theory. It's the most robust theory of quantum gravity, the math (from a layman) all works and is logical, but none of it is even barely testable. The closest they've got is finding weird long structures and bubbles that could be better described with string theory but they are far, far, far from any smoking gun results.
I love it when serious, rigorous work can also be a little silly.
The title is a bit inaccurate. It's specifically about convex polyhedra - not just shapes.
A sphere (not a convex polyhedra) is trivially non-Rupert, and it's also pretty easy to come up with concave polyhedra that fail this test. As the polyhedra they work with become increasingly close to spherical, I suspect it's also becomes more likely that they cannot pass through themselves.
Interesting! Is there any practical application for either the noperthedron or the software they're using?
Not yet! 😁
It makes a nifty pencil holder ?
The article mentioned aliens. Maybe there's a whole category of math things that have no practical application whatsoever until we meet other species, and they'll recognize/categorize us along an intelligence scale using these. Sort of like how we applaud parrots for fashioning tools and we like it when belugas like to scare toddlers for fun.