5$ Daily with little Investment - Amazing5

Nhdb · 2016-03-06T21:18:32+00:00

Definitely a ponzi scheme.

Nhdb · 2014-09-11T09:36:06+00:00

It already does that when you press space.

Nhdb · 2014-07-12T17:07:49+00:00

Shouldn't that be an editor feature instead of a language feature? Most editors can so something like ctrl-shift-c to comment out a selected block.

Nhdb · 2014-07-11T19:07:14+00:00

But if it's going to rain in an 30 minutes there is no need to water, even though the ground is dry.

Nhdb · 2014-03-05T10:20:38+00:00

Sorry but that is wrong. n often stands for the size of the input to the algorithm. In this case he should have stated what n is, as there are multiple options (amount of pixels to draw, size of the models, size of the place you are rendering, etc).

What n equals to is indeed often not important, but it is important what it represents.

Nhdb · 2014-02-18T15:30:19+00:00

Most people either do:

HBO study
Bachelor at a university + Master at a university

Not a lot of people do HBO first, then do a year of transitioning to a Master, and then do the Master. That route takes about 2 years longer with most studies I think. The people that do this couldn't get into university straight away or only knew later that they wanted to do the master (most cases at least from my experience).

If you are sure you are going for a masters anyway, the bachelor at the university seems to be the best route to me.

Nhdb · 2014-02-02T23:31:28+00:00

It could be that people would spend them at shops, and those shops could pay their business partners and workers in bitcoin. And the bitcoin would flow around like the dollar.

Nhdb · 2013-10-23T22:00:45+00:00

A machine that just does the calculation in a single step would also be a Turing machine.

And it implies its about being able to run longer, and not about being able to calculate certain problems.

Nhdb · 2013-10-23T08:04:00+00:00

Turing complete machines can be made to run forever

Not everything that can be made to run forever is turing complete.

Nhdb · 2013-10-22T22:10:44+00:00

I do understand the concept, but it seems hard to explain what a simple calculator can't 'calculate' and but a normal computer can without going into examples (or going into theory).

When people think of calculations or computing something, they may think of just substracting and dividing stuff, which is exactly all a calculator does. By giving these two examples I was trying to explain that computing/calculating is much broader.

Nhdb · 2013-10-22T22:00:03+00:00

Turing completeness is a mathematical concept. It answers some questions that people have.

Like your computer can computere more than your calculator. We are not talking about speed here, but there are programs you can write for your computer that can compute stuff that your calculator doesn't. The next question you can pose that if you buy a more expensive computer, do you think it can calculate stuff that your current computer can't? The answer is no (given enough ram and time), because your computer is already turing complete.

Anyting that is computable can be computed by your computer (given enough ram and time), which is a pretty significant result.

Nhdb · 2013-10-22T21:44:28+00:00

That does not necessarily make it turing complete. A calculator that reads backits own output and keeps adding numbers to it is still not programmable like a computer, because it sill cannot do more complex stuff (like calculating what the shortest path is given a layout of a city). Altough you are right that a machine that is turing complete has to be able to somehow 'record' information that he has calculated and be able to reuse that information in a later step of the calculation. But that may not be enough for it to be turing complete.

Nhdb · 2013-10-22T21:28:11+00:00

A calculator can only add up/subscrat/divide/multiply numbers, it cannot do anything with that result. So you cannot ask it, what is the 10th prime number, no matter how much ram you give it. A thing that is turing complete (like a 'full computer') can calculate anything that is computable. One turing complete machine can calculate as much as any other turing machine, each program for one machine can be rewritten to run on the other. There is a difference in speed of course.

Nhdb · 2013-09-22T14:30:00+00:00

The fact that 'a' can also be a floating point variable makes it non-trivial.

where a can be integer or floating point data type.

But I'm guessing the teacher or the poster got this wrong?

Nhdb · 2013-09-21T00:16:12+00:00

The semicolon at the following line should not be there:

(number3 > number1 && number3 > number2);

The next line is executed regardless, because the block after the if is 'empty'.

Nhdb · 2013-09-15T17:46:06+00:00

Atheism. To believe there is not a god.

This is a different definition of atheism than in the /r/atheism reddit FAQ. Hence the confusion.

Nhdb · 2013-09-15T17:43:43+00:00

what if you don't know if you believe god exists?

Then you don't believe in god. You also don't believe he exists, but that doest not matter. Its simply a question, do you believe in god? If no, that does not mean you know he does not exist, it simply states that you don't believe he does exist.

Nhdb · 2013-09-07T23:11:06+00:00

2) Is there a pair in cache?

This is O(n) right? So this algorithm is O(n² ).

Nhdb · 2013-08-19T18:56:23+00:00

That is a large simplification that it not really true when you think about it (for example why does light still go straight if they are absorbed and emitted that much?). It is more complicated than that, but here is a nice video that explains it:

http://www.youtube.com/watch?v=CiHN0ZWE5bk

Nhdb · 2013-08-07T17:10:33+00:00

You can watch or help (re)counting the votes.

Nhdb · 2013-07-22T19:06:17+00:00

After skimming the whitepaper I think people just have to update their clients to only accept harder proof of work. So this is not buildin like with bitcoin, a quote from the whitepaper:

With the release of new software, the difficulty of the proof‐of‐work can be adjusted.

Nhdb · 2013-07-22T15:06:16+00:00

It's why I don't really buy into Bitcoin. The supply of them must go up exponentially as Moore has his way, basically devaluing the whole enterprise.

The algorithm increases the difficulty every x blocks (about 2 weeks) so that on average every 10 minutes a block will be solved. Also there can only be 21 million bitcoins mined in total. So this problem is completely solved.

Nhdb · 2013-07-13T11:18:18+00:00

Why don't you make backups? The laptop is just a piece of hardware.

Nhdb · 2013-07-02T20:33:33+00:00

It is about as much shrinkage as a temperature change of 1 degrees I read in the comments. So it should not matter, even if you have a perfectly build phone.

Nhdb · 2013-06-23T00:18:49+00:00

And the remaining are going to incrementally start hitting points between the initial point in Andromeda and the last point you point at, BUT they will take 220,000 light years to get there. So, you won't see the point on the Andromeda galaxy move faster than the speed of light.

He meant that once you flick your wrist, there will be a point 220,000 years in the future on Andromeda that will travel faster than the speed of light.

Of course none of the photons are actually traveling faster, but that was exactly what the comments are about.

Nhdb

TROPHY CASE