Re: AI and social destabilization

> On 170620, at 6:55 PM, spudboy100 via Everything List > wrote: > > Will UBI triumph Can’t sell if no one is able to buy -- You received this message because you are subscribed to the Google Groups "Everything List" group. To unsubscribe from this group

Re: AI and social destabilization

> On 170620, at 5:57 PM, Brent Meeker wrote: > > And don't get too comfortable because you're not one of those billionaires. > I'd guess that everyone on this list is in the top 0.002% of the world wealth > distribution. > > Brent -- You received this message

Re: Consciousness/Intelligence (was Re: From Atheism to Islam

> On 170223, at 3:23 PM, Brent Meeker wrote: > >>> John McCarthy warned many years ago that we should be careful not to create >>> robots that had general intelligence, lest we inadvertently create >>> conscious beings to whom we would have ethical obligations. >> >>

Re: Metastable metallic hydrogen propulsion

eaction the Isp > would only be 3 times as high. Still far lower than nuclear rocket and 52e3K. > > Brent > > On 1/26/2017 8:05 PM, Hans Moravec wrote: >> I think the intent is that metallic hydrogen alone is the fuel, >> as a metastable way of storing some fraction of at

Re: Metastable metallic hydrogen propulsion

> more compact and lighter, but don't see how it can raise the combustion > temperature of the Isp. > > Brent > > On 1/26/2017 4:24 PM, Hans Moravec wrote: >> Something like antimatter propulsion, but much easier? >> >> Metallic hydrogen: The most powerful rocket

Metastable metallic hydrogen propulsion

Something like antimatter propulsion, but much easier? Metallic hydrogen: The most powerful rocket fuel http://iopscience.iop.org/article/10.1088/1742-6596/215/1/012194/meta Hydrogen Squeezed Into a Metal, Possibly Solid, Harvard Physicists Say

Re: The Weirdening

I’m on the list. Clammed up around 2000 to get on with robot building. Someday they can answer for themselves. Still a few decades to go, but I expect some machines built to work around people will act as if they have feelings, and awareness of others’ feelings. For all practical purposes

Re: The Weirdening

Was expecting you, Brent, to remind Telmo of an SF story you've recommended in past, that disarmingly unrolls increasing subjective weirdness from MWI immortality. Divided by Infinity Robert Charles Wilson 1998 http://www.tor.com/2010/08/05/divided-by-infinity/ > On Dec 27, 2016, at 13:34 ,

Re: LIGO found a second Black Hole collision!

nti-matter powered spaceships; which I > thought was a crank idea. > > Brent > > On 6/16/2016 5:18 AM, Hans Moravec wrote: >>> On Jun 15, 2016, at 23:48 , Brent Meeker <meeke...@verizon.net> wrote: >>> >>> When you look somewhere new, you see new thin

Re: LIGO found a second Black Hole collision!

> On Jun 15, 2016, at 23:48 , Brent Meeker wrote: > > When you look somewhere new, you see new things. To bad Joe Weber didn't > live to see this. > > Brent And Bob Forward (Robert L. Forward), who was once Weber's grad student, and continued gravity related research

Provably exponential time algorithms

Encountered this on sci.math From: Robert Israel ([EMAIL PROTECTED]) Subject: Re: are there problems that provably take exponential time to solve? Newsgroups: sci.math Date: 2002-12-30 13:59:18 PST Bennett Haselton [EMAIL PROTECTED] wrote: Has it been proven that there are problems which are

Re: Quantum Probability and Decision Theory

Hal Finney: there are no known problems which take exponential time but which can be checked in polynomial time. If such a problem could be found it would prove that P != NP ... Communications glitch here. The definition of NP is problems that can be solved in polynomial time on a

Re: Quantum Probability and Decision Theory

Hal Finney: I'm not sure if you are disagreeing with either of my statements above, that (1) there are no known problems which take exponential time but which can be checked in polynomial time, or that (2) if such a problem could be found it would prove that P != NP. Ah, I see the

Re: Quantum Probability and Decision Theory

http://www.math.okstate.edu/~wrightd/crypt/crypt-intro/node23.html ... It is suspected but not yet known that factoring is NP-complete. Of course, if factoring were to be shown NP-complete and quantum computers could be built to run Shor's factoring algorithm in polynomial time, then quantum

Re: Quantum Probability and Decision Theory

Brent Meeker: It seems [factoring] has been proven recently to be in P: http://crypto.cs.mcgill.ca/~stiglic/PRIMES_P_FAQ.html#PRIMES No, that's primality testing, which has always been much easier than factoring.

Re: Fwd: Implementation/Relativity

[EMAIL PROTECTED]: Earlier I think Hans said that one possible observer was the conscious entity himself. I am an observer of my own consciousness. My consciousness (or lack thereof) is subjective, and varies depending on the observer, but one of the observers is me. Does this mean that

Re: Implementation

[EMAIL PROTECTED]: My view is that it is possible that the isomorphism exists, but I am not convinced that it is guaranteed to exist. Much information is not recorded in the HLUT - emotional states, alternate answers which were considered and then rejected, etc. People have been known to

re: Relative consciousness (was: Alternate deductive route ...)

[1: human in physical world, 2: AI robot in world, 3: human in VR, 4: AI in VR] Russell Standish In-Reply-To: [EMAIL PROTECTED] from Hans Moravec at Jul 7, 99 06:02:12 pm [ 1: human in physical world, 2: AI in physical world robot, 3: human in VR, 4: AI in VR ] We have already