Starting today August 7th, 2024, in order to post in the Married Couples, Courting Couples, or Singles forums, you will not be allowed to post if you have your Marital status designated as private. Announcements will be made in the respective forums as well but please note that if yours is currently listed as Private, you will need to submit a ticket in the Support Area to have yours changed.
I'd be more inclined to think that morals are goals and therefore cannot serve them. Moral principle is based on what you want not how you can get it.
It tends to come with accusations of back-sliding and goalpost-shifting. Ah, the Internet is a fickle mistressAny opponent worthy of being an opponent would think highly of you for having told them of a well-considered change of mind (even on the mean streets of the internet).
It all got a bit muddled when my original series of threads got closed down. I'm still going to come to these threads as if they were my own, however. The tradition of the original 'Ask a Physicist' was that anyone could ask, and anyone could answerLoL I was thinking this was your thread with a name change haha
You can still answer my question if you want.
My weekend went great thanks! I've come back to find myself inundated with thread updates and a delicious smattering of PMs. CF is funhey Wiccan
How's your weekend going and Who's your favorite Physicist & Why?
That's cool. I like that idea.It all got a bit muddled when my original series of threads got closed down. I'm still going to come to these threads as if they were my own, however. The tradition of the original 'Ask a Physicist' was that anyone could ask, and anyone could answer.
ha ha Yeah CF is pretty all right. I like ncr sections the best.My weekend went great thanks! I've come back to find myself inundated with thread updates and a delicious smattering of PMs. CF is fun
LoL that's always a great pic of Einstein. My favorite pic of him tooAs for my favourite physicist, I'm torn between the traditional choice of Einstein:
A few, but I don't go there - it's not as much fun talking to people I already agree withThat's cool. I like that idea.
ha ha Yeah CF is pretty all right. I like ncr sections the best.
LoL that's always a great pic of Einstein. My favorite pic of him too
Do you know of any cool Atheist forums to hang out in?
"The most incomprehensible thing about the world is that it is comprehensible."
To me it means that the world we live in is comprehensible, and that this fact is astonishing. There's no reason why we should be able to comprehend the world, yet we do - Einstein was marvelling at how we can comprehend atoms and molecules, and stars and galaxies, yet they are far removed from our everyday experiences.What does that quote mean to you?
When trying to combine fractions, such as:How do you find least common demonator when it comes to complex fractions?
Sounds like a variation of the travelling salesman problem called the travelling tourist problem. I know that to find the Hamiltonian cycle is NP-complete, and there is no general solution - but you want to find the most efficient route that doesn't necessarily only visit each node once. You might investigate Eulerian cycles, which visit each edge once but each node multiple times - since you have no edges, you could arbitrarily create them, perhaps? That said, since your nodes are unconnected, I suspect there is a Hamiltonian cycle after all.Ok, Math / Path Optimization Time
I've got a grid with X number of points on it
What's the best way of determining the optimal path to stop at each point at least once with minimal movement.
Sounds like a variation of the travelling salesman problem called the travelling tourist problem. I know that to find the Hamiltonian cycle is NP-complete, and there is no general solution - but you want to find the most efficient route that doesn't necessarily only visit each node once. You might investigate Eulerian cycles, which visit each edge once but each node multiple times - since you have no edges, you could arbitrarily create them, perhaps? That said, since your nodes are unconnected, I suspect there is a Hamiltonian cycle after all.
If you want to find it, you'll have to do it algorithmically. Exhaustive computer programs can do it, if you have the prowess.
Also, kudos on having your own webpage
ThanksThat gave me the proper nudge (Traveling Salesman works / Traveling Tourist won't really work)
Back to coding now
Going to be fun though, I might have up to 2000 nodes though
It's for a Robot I'm developing
Got to have it efficient in drilling holes in it's target
(Got its accuracy down to about 1/10 of a mil right now)
That's a mighty fine drilling machine - what're you drilling? Mirco black holes? Oh ho ho ho...It's for a Robot I'm developing
Got to have it efficient in drilling holes in it's target
(Got its accuracy down to about 1/10 of a mil right now)
We use cookies and similar technologies for the following purposes:
Do you accept cookies and these technologies?
We use cookies and similar technologies for the following purposes:
Do you accept cookies and these technologies?