4 ms·
Here are two good practice problems for testing your personal bogometer: http://sparsey.com http://sparsey.com https://www.agilepq.com https://www.agilepq.com
by lisper 8y ago
Here are two good practice problems for testing your personal bogometer:
http://sparsey.com http://sparsey.com
https://www.agilepq.com https://www.agilepq.com
It's not P=NP but two similar problems that attract a lot of quackery.
- pmiller2 8y agoAre those even serious sites? They look like what happens when a Markov chain program meets a mediocre web designer.
- lisper 8y agoSadly, yes. I personally know someone who has invested in one of them :-(
- CodiePetersen 8y agoI can assure you that Rod Rinkus', Sparsey creator, work is very serious. He is a computational neuro scientist I've actually been working with him since october. But he has said the website has needed some updating for a while now. One of my primary jobs will be to get the demos up and running with a more updated feel. I'm not sure of the other site, but I have done the work to recreate Rod's work from scratch and he has done several tests to prove the system works. Most of his work was done through DARPA and ONR research grants. He has only really recently decided to try to make a profitable company off of it recently, before that it has always been funded through research grants. As for the look and feel of the website, which in reality has no merit on whether the research is legitimate or not, I have joked that he just needs to market himself better and he has laughingly agreed. But you can hit him or I up if the research is to hard to understand from a glance. We are trying to practice how to pitch it to people better so it's easier to understand. But once every thing clicks, its actually a really simple concept, it's just that its a highly recurrent system. I had to program it out piece by piece before things started making sense.
- CodiePetersen 8y agoI'd like to know what you don't understand about the Sparsey algorithm that makes you think it is "quackery". I've programmed it from scratch (I've been working with him since October), Rod Rinkus has several tests that have proven it, Paul Franzon designed GPU & SIMD architectures and an ASIC chip and tested it against Numenta's HTM's which Rod's was faster but consumed more power, and also DARPA & ONR have granted him research grants to develop the algorithm. So I think your claims of quackery are a bit unfounded, but I'd still like to know your thoughts. If there are people out there who think it is impossible or lacks credibility then we need to address that. I hope it's not just the website look xD. He has been saying he needs to change the website because it's old but he hasn't done so yet.
- lisper 8y agoI didn't say it was quackery. Now, I happen to believe that it is quackery because Gerard in private correspondence claimed that Sparsey achieves quantum supremacy on classical computers. That is an extraordinary claim but he did not provide any evidence to back it up, and when I suggested a simple demonstration he could do to back it up he demurred. It's possible that Sparsey does something interesting, but it's (almost certainly) not what Gerard told me. That's why I think that evaluating it makes a good exercise.
- CodiePetersen 8y agoI'll let him comment on what you guys were talking about but I know of his theory that you are commenting on. But I'm pretty sure you have misunderstood what he was talking about in terms of what sparsey does vs his ideas on parts of it (SDRs specifically) being framed as an alternative to quantum computing. You should have linked his direct thoughts on the qunatum computing parts, instead of throwing all of Sparsey under the bus. http://sparsey.com/SDR_and_QC.html http://sparsey.com/SDR_and_QC.html You may have not directly called it quackery but you suggested and alluded to it requiring a bogosity meter and that quacks are attracted to it. It's pretty clear what you meant, to be honest. Sparsey in general though is a separate subject really. What it is doing is capturing all the features it has ever seen and building temporal and spatial relations between those features and then storing those as a code that represents an input in a particular spatial and temporal context. So if I have the words CAT and BAT the A in CAT and the A in BAT will have different codes because of the letter that came before it, likewise with T because A's code is different for both C and B therefore so is T's in both separate cases. So I think that is where the whole quantum part comes into his ideas. Every sample in a sequence has many possible "realities" or codes that can represent it and by representing it in a certain way you are also representing an entire sequence that came before it and a branching point of possible future representations. I have near zero experience with quantum mechanics so I won't comment on how closely it is or isn't to that, because I have no clue. More importantly though, even if it doesn't represent an alternative to mathematically tit for tat exactness for quantum computing, what it can do is reduce computation times dramatically. The idea is that for an equation you could give a sufficiently sized sparsey model a number of inputs. Sparsey naturally represents those inputs as some representation and you can assign the answer to that representation, and you do that with all or as many inputs as possible, each getting its own unique representation. So basically what you are doing is making a giant lookup table of answers. So when you see a set of inputs you know the answer via code lookup rather than calculating it. Sparsey is a bit memory heavy so you would only really want to do that with large hard problems. But that's where the speed comes in, you know instantly the entire state, its past, and its likely conclusion (because it probabilistic), or in fact all of its possible conclusions. It's similar to Q Learning in some ways, in the sense that you are storing many many states you have encountered. Except sparsey doesn't store the states brute force like qlearning. Similar states, spatially, temporally or both, are stored with more code overlap, dissimilar ones have less overlap. But that's the gist of it. He has some results posted. We've talked about getting some sort of public repository up and running for people to play around with and maybe a community forum or something, but that's one of his concerns lately, letting people see the results for themselves rather than taking his word for it. Which, I have one project I need to finish right now, but I will be working on that full time sometime in May.
- roddyrink 8y agoWow! Lisper, Ron Garret. This is Rod Rinkus, inventor of Sparsey. You and I had what I thought was a congenial email exchange about quantum computing a month ago. And, here, out of the blue, you disparage my work in the public square, and in a cowardly fashion, behind my back. I guess that says a lot about your character. Yet, your comment really doesn't make much sense, does it? You even begin your comment with a disclaimer to the effect of "This is really not relevant to this thread"..but then you go on to disparage my work. Kind of a weird thing to do. We're you drunk? In any case, I demand a public apology from you, here in the public square, where you committed your cowardly wrongdoing. We'll see what you're made of in how you handle that. If you have enough conscience and consciousness to apologize for your behavior, then we can move to you explaining your specific criticism of my work, which is now incumbent on you, is it not?..since I've called out your unwarranted and thoughtless attack. This will be a lot of mental work for you, since, thus far, you demonstrate no knowledge of Sparsey, or any of the relevant computational principles. But again, that will take you a long time. So, I recommend you apologize first, rather than keep your audience waiting.
- lisper 8y ago> I demand a public apology from you, here in the public square What exactly is it you want me to apologize for? Have I said anything here that is factually incorrect? > You even begin your comment with a disclaimer to the effect of "This is really not relevant to this thread" No, I ended my comment with the following statement: "It's not P=NP but two similar problems that attract a lot of quackery." And I stand by that. > you demonstrate no knowledge of Sparsey I don't claim to have any. My opinion of you and your work is based entirely on the fact that you claimed to have achieved quantum supremacy on a classical computer, an extraordinary claim which you failed to back up with any evidence. When I suggested how you could provide that evidence (implement Shor's algorithm) you balked. That is the sum total of the evidence on which my opinion of you and your work is based. It's quite possible that Sparsey has merit, I don't know. What I do know is that whatever merit it may have, it isn't what you told me it was. (The whole situation is very peculiar because in our private correspondence you really emphasized the quantum stuff, but your web site doesn't mention it at all. This leaves me nonplussed.) > you disparage my work in the public square, and in a cowardly fashion, behind my back If something is done in public it is, by definition, not behind anyone's back, so I think you should apologize to me for accusing me of behaving in a cowardly fashion. If you can demonstrate that something I said was wrong, I will absolutely apologize for it. But if you want me to change my opinion you will have to do with with evidence and persuasive argument, not insults and demands for apologies. But before this spins too wildly out of control, let's start by publicly clearing up the factual question at the heart of our disagreement: do you stand by the claim you made to me in private (but which I cannot find any record of you having made in public) of having achieved quantum supremacy on a classical computer?