Recursion is cool
http://www.cplusplus.com/articles/D2N36Up4/

Yes! Technology is a relationship of free will, and technology should never control us.

I'm definitely not for "preventing" anything. If people want to put their entire lives on their devices, they are free to do so.

I keep a list of my contacts on paper and on my computer. I won't be one of those who "lose all my friends" because I lost my phone.

I think that this is a very difficult issue to solve. I mean, even if we could trust our cloud providers to protect our assets better than our naked photos... we (normals and techos) just aren't ready, right?

You'd be playing Russian Roulette when you entered your credit card information on a web form 15 years ago, so its not like people should stop trying solutions today.

I'm ready. I few months ago I asked about password providers and people gave me lots of good cloud-options.

At a bare minimum there will always be the option of using the cloud for pure untrusted storage and your devices doing all the encryption/decryption locally.

My C++ is pretty weak as I am just learning it, but if I make a Struct that lives on the stack inside a function call, won't it be gone once that function returns?

I'm pretty convinced nearly everything we currently use can be hacked.

If China's quantum encryption network ends up having vulnerabilities I think it might mean that 100% of everything we are currently using could potentially be hacked, at least in theory.

http://www.telegraph.co.uk/news/worl...o-hackers.html

I didn't mean you as in a technical user, but (collective) you as a technical creator. I think something interesting will come down the pipeline, but I don't know how long it will take before we reach a bar high enough to shift all our currency holdings from the bank to the cloud, or whatever. There was an interesting article on HN about the lagged pace of banks.

If we look at "The Snappening," we are led to believe that it wasn't SnapChat, but the third-party tools that caused the leaks. This is something that would have to be dealt with, and with a firm hand, which ends up taking away software freedom. I think that, intuitively, end-users have a desire for freedoms like this.

There are so many difficult issues to consider, both technical and social, but don't let that discourage anyone.

I thought the theory was that everything could be hacked, but the goal was to make it take so long that it wasn't worth the effort.

Not sure if this is what you're trying to do or not.
http://pastebin.com/7TvN3tqa

I think we mean more about architectural vulnerabilities that we believe are inherent in almost every system we currently use not just brute force.

Also, this Chinese system is supposed to be theoretically impossible to crack.

Yes

The only issue with this approach is that if N is large then you may not have enough stack space. Each call to recursion creates a stack frame.

I had a program that I let run for 15 minutes, yet it never finished. I rewrote it and now it finishes in about 1 second.

Another part took 4 seconds. After a rewrite, it now runs in less than 2ms.

This never stops feeling good, right?

I assume he is taking a class but what would you recommend for not running into that problem. tail calls?

Since we're in the C++ domain I'd use an appropriate STL container.

Edit: I just wanted to be clear that I don't think there is anything wrong with using recursion, in fact I like it a lot. "Blowing up the stack" is just something that should be considered when using recursion and yes using an STL container probably doesn't solve the issue KataKrazy brought up (I am not sure I understand the issue though) but I would still use an STL container (vector, list) since it is C++.

I'm not even sure I understand the problem. It was given to me Friday afternoon and I think I need to ask some more questions Monday morning before starting.

it's pretty reliable

Tall call builds a larger stack, I think.

Not a larger stack no. What happens is that there are compiler optimizations that turn tail-call recursion into an operation that doesn't have to push a stack frame for each recursive call. So you have no issues with stack overflow.

edit: the gist is that the recursion is turned into iteration one way or another. Some examples here

I'm thinking about a compiler that isn't optimized for TCO.

I know JVM and Python can't TCO.

.net, erlang and haskell can optimize tail calls.

Sent from my C6603 using 2+2 Forums

Someone on Reddit put together a well cited summary of the entire Sony incident for those interested in what is currently known.

cliffs: LOL SONY

http://www.reddit.com/r/worldnews/co...erview/cn0ksh7

I read these last winter and nearly had an aneurysm with part 2. He tried to explain the method with some crazy time travel analogy and completely lost me.

LOOL:

My two favorites are definitely:

SRI Employees Levels_401(k)sort_passwordv2

pass

yeah the analogy seems unhelpful to me too.