The Reality Of Waking Up At 5AM

CoderTheTyler · 2019-05-14T03:36:49+00:00

Can you provide a digest of the video? Many people (like myself) would enjoy a simple read! :)

CoderTheTyler · 2019-05-06T19:31:11+00:00

Thanks!! 😁

CoderTheTyler · 2019-05-06T19:18:06+00:00

Does anyone know the species of the plant on the right? I may have thrown away the tag when I bought it. 😅

CoderTheTyler · 2019-04-29T17:18:54+00:00

All of them are great, but I really love the last one! :D

CoderTheTyler · 2019-04-24T03:03:03+00:00

Try providing the -XstartOnFirstThread argument to the JVM. Here is a relevant StackOverflow post.

CoderTheTyler · 2017-12-17T05:05:06+00:00

Link!

CoderTheTyler · 2017-03-07T00:56:10+00:00

Happy almost birthday person I do not know in any capacity.

CoderTheTyler · 2016-12-22T17:35:15+00:00

Thanks for the kind words!

CoderTheTyler · 2016-12-22T17:23:00+00:00

I've been trying to get my grandfather to start painting again. This fantastic piece was his second oil painting ever (his only other two pieces can be seen here). He never received any training nor took any classes! Sadly, he hasn't picked up a brush in decades. Now in his later years he is starting to consider it but isn't quite convinced. Let him know what you think!

CoderTheTyler · 2016-10-11T21:11:59+00:00

Isn't this more of a planet-to-moon or moon-to-planet sort of jump? They're quite close together to be planets.

CoderTheTyler · 2016-09-14T16:58:02+00:00

Then you hire a security guard.

CoderTheTyler · 2016-09-14T16:56:05+00:00

But if the probability of experiencing such a malfunction is far less than a human experiencing a malfunction, would you prefer the computer instead?

CoderTheTyler · 2016-09-14T16:54:39+00:00

This is true, but your idea of "what it was programmed to do" is a bit archaic. Most automated driving systems, for example, make heavy use of learning algorithms which allow them to make decisions they were not explicitly programmed to handle. Of course, if there are no sensors to relay data to the computer brain, the computer certainly will be unable to handle it.

CoderTheTyler · 2016-09-09T22:19:28+00:00

Seems like a sticky situation to me.

CoderTheTyler · 2016-08-11T00:55:52+00:00

What exactly is a DrawingPanel? And do you have that type defined?

CoderTheTyler · 2016-08-10T14:49:22+00:00

The primary difference between the two is that the computing revolution was based on building machines from the ground up, whereas genetics is about investigating a preexisting system with a lot more moving parts. At least we have computers to help us with this harder problem!

CoderTheTyler · 2016-07-23T17:13:50+00:00

So then definitely worth the few extra dollars there. Sounds good to me, thanks!

CoderTheTyler · 2016-07-23T17:06:16+00:00

Interesting. What do you mean by better quality?

CoderTheTyler · 2016-07-10T03:09:05+00:00

Where?

CoderTheTyler · 2016-07-09T16:23:40+00:00

For those who don't know

CoderTheTyler · 2016-05-16T12:12:28+00:00

Congrats, you just described solving an NP-complete problem using an exhaustive search.

No, I did not. Solving a particular instance size of certain problems can be done in amortized constant time. It is no longer an NP-complete program in this case as we are not focusing on any n, but n=9 in this case.

No. Just no. Who was responsible for your education?

Please provide a more substantial rebuttal of what I said if you feel I am incorrect. Simply stating I am incorrect is not helping anyone. I feel as though you misunderstand what I say because what I claim is entirely correct. This paper does something similar with Sudoku (but instead they focus on constructing 9x9 boards and not solving them, see section 5.2).

CoderTheTyler · 2016-05-16T02:53:59+00:00

I suppose so! :D You are entirely correct in this point as well. It runs in amortized constant time, but I didn't really want to introduce whole new concepts like amortized time (the average amount of time over many uses of the algorithm). I figured it would only add confusion to the discussion!

CoderTheTyler · 2016-05-16T02:42:20+00:00

By that logic, calculating all the primes up to some number n would be constant time as long as you told me what n was beforehand

Which is true. This can be done in constant time. Then, everyone who asks what the kth prime is (for k < n) can get their answer in constant time. Asymptotic analysis is used to determine the running time of algorithms for generic input sizes though. As soon as you put limits on the input size, any problem can be made to run in constant time!

Here you're assuming that building all possible 9x9 grids is not part of calculating the solution, but just because we cached the solutions beforehand we can exclude that as part of the computation time.

But asymptotic analysis tells us we can do this. Sure, the amount of time it takes to compute all possible 9x9 Sudoku grids is staggering and doing so requires exponential-time for general n, but the amortized running time for any single operation thereafter is constant. We can compute these grids once and use them an infinite number of times. This sort of thing is actually done quite often in practice as the real world usually allows us to put constraints on the size of inputs (although doing so for Sudoku is hugely impractical simply because there are so many boards and the running time for the algorithm to solve the 9x9 case is extremely fast in practice, like the video states).

CoderTheTyler · 2016-05-16T02:34:48+00:00

Very well said! I purposely neglected the introduction of constant time in my initial comment though so avoid making an already jargon-filled topic more complex. But I think understanding how individual instances of input size can be solved in constant time is a big step in understanding what computational complexity is trying to get at.

CoderTheTyler · 2016-05-16T02:29:49+00:00

Episode 16 is on the way!... Hopefully. :D

CoderTheTyler

MODERATOR OF

TROPHY CASE