## Why do I always have something missing in my understanding of topics which always lead me to solve problems incorrectly?

I am computer science masters student, i come from background of engineering and not cs, my problem is whenever i have a problem set, a programming task or an exam. i always try hard to understand the question and think for the right answers, but i usually either get stuck or have a wrong answer, and when i seek help i figure out i wasn’t completely understanding the topic of the question itself, missig some part of the information in or even having a wrong understanding to some parts.
So my question is, how i can approach a computer science topic “for e.g. operating systems” and have a good understanding with the right depth to have a better comprehension and to be able perform better at programming tasks and exams.

## Rotate object always at same speed on screen, no matter camera distance?

I am rotating a globe like XCOM’s hologlobe,

I rotate it using Quaternion.RotateTowards(Quaternion from, Quaternion to, float maxDegreesDelta).

I found a good value for maxDegreesDelta, in my case it is 5.0f.

There is a limit on how close or far the camera can be, let’s assume clos is 1.0f and far is 2.0f.

I want to be able to zoom into the globe, but obviously when I do, it rotates a bit too fast then.

When zoomed out, rotation speed is satisfying:

When zoomed in, rotation is too fast, making it more difficult to manipulate:

And the problem is even more evident as game view size gets bigger, i.e. fullscreen.

Using Mathf.Lerp and Mathf.InverseLerp, I’ve tried to make maxDegreesDelta and mouse delta proportional to the distance the camera is but it’s hardly convincing.

Note: I rotate the globe, not the camera.

Question:

How can I ensure object rotates at same speed on screen, no matter how close or far camera is ?

## Spaced-bounded Probabilistic Turing Machine Always Halts

For example, in the definition of BPL, we require that the probabilistic Turing machine has to halt for every input and every randomness. What is the reason for us to define them this way? What would happen if they don’t halt? On the other hand, we don’t require space-bounded non-deterministic Turing machines to halt.

## Is there always a “designated” person to lead/move the party?

After have played only a few session (actually 5 sessions of 2-4 hours) I’ve noticed something that I found quite strange.
In our group we are 4 players: I (Newbie), A (Experienced), B (Newbie like me), C (Beginner).

This is an optional description of them that you don’t have to read if you don’t want.

• I‘m always quite quiet, looking for in the situation trying to understand the scenario and the behavior of both NPC and the other PCs (AKA: learning). Also, I always take care of the team, I mean, I always try to do the most wise and less dangerous or self-destructive actions (like ask forgiveness to someone that C tried to persuade with a low roll) – when they give me a chance.
• A is 100% of the time roleplaying, he is really in his character and play as him character would do. Even when he speak, he speak as if his character would do, his way of play it’s inspiring. Like a good paladin he helps weak NPC, he complete his promises and fight with evil creatures until death (actually he use his body as a shield for us). Also, basically he is the only reason why we are doing the campaign of the DM (he offer him self to protect a lady while we are moving his to another safer location).
• B is really indecisive (maybe a bit like me, but I don’t start speaking randomly when I don’t know what to do). Sometimes he has some interesting ideas using his druid’s spells but it’s difficult for him explain that ideas. He is the most charismatic person in the group but he almost never talk (and when he do it he has really bad rolls). Also, I am not sure if this is his natural behaviour or if he was depressed by his bad rolls, but in the last session he get drunk (his PC not himself), cast a destructive spell randomly “because of his drunkness” and killed C… he always do roleplaying in the worst situations…
• C is interesting, great part of time he is wishpering (secret chat) with the DM (I know that because sometimes they forget to use the whisper command) and he do strange but also interesting actions (like try to take a raven and discover actually they were 3 druids, try to steal a horse, get an arrow shot, be killed by B and all of us be kicked and banished from the tavern… all in the same hour, when our actual mission was get some information of a certain person).

Okay, that was our team description. The problem or curious thing I note is that A is always moving or leading the group with his perfect roleplaying, we are the 80% of time following him, while he is talking with an NPC we are just looking around the place, and when he want to do something (kill some harpies or defend a lady) we follow his command, willing (like me), or unwilling (like B).

But, when A isn’t present (2 of the 5 sessions) the session get slower, the DM explain the situation and… we don’t answer, we aren’t sure what to do, our only reason to protect the lady is that A convinced us, he has the plan, not us (also, in the same day he wasn’t present we reach our destination so we wasn’t sure what to do at next). Because no one was doing something and the silence was getting longer I felt the responsibility/obligation of keep moving the session in order to not get stuck, and I tried to do my best, but it was difficult, I don’t use to talk so much and try to give orders to people that are’t willing to obey me or has different opinions.

Luckily, in the first time I managed to move them to a shop place, and the DM used the rest of the session’s time to sell items. But in the second time, I barely move them to a tavern and I get exhausted, they started doing stupid and unproductive things (well, B had an interesting idea, talk to the drunk people in order to gather information, sadly, he also got drunk) while I was trying to get some information, while at the same time NPC weren’t willing to give me that information and they started looking us (with a focus on me) in an uncomfortable way.

My question is: Is it normal that there is always one PC designated to lead the whole party (talk with NPC, gather information, give orders, etc)? Also, in the case that “the leader” isn’t present, How can I (as player) encourage the others PCs to keep moving in the campaign and not get stuck or do unproductive actions?

## BlockChain: Always get a new Hash

I am asking a simple question. Why we say that we would always get a new hash in a blockchain? Why we can’t have collisions?

One way of collision is that the hard disk becomes full and there is no more space to store a transaction.

Zulfi.

## Experiments Always Fail

I started using scrapebox 2 weeks ago. nothing I have done has worked except the keyword scraper.

I was trying to find an available domain through domainlookup. and an error message indicates a timed connection error. can you help what should i do?

https://prnt.sc/qh27vx
https://prnt.sc/qh284u

## vsmathur(dot)co(dot)in opens newsletter(dot)wordpress(dot)com always – Help!

I have my website at vsmathur(dot)co(dot)in and have somehow managed to mix-up the DNS Records in a way that newsletter(dot)wordpress(dot)com always opens when I open the former site. Anyone can help? Even the wp-admin command opens up the latter website instead of the former. I am told I should get a professional wordpress expert to correct this for me, but am thinking that I am only a few inches away from doing this myself, considering that the dead website was made alive by me, whether by accident or design, I do not know.

So any kind of guidance would be very very welcome, thanks in advance. CA Vikram Shankar Mathur

## Find a threshold such that one function is always bigger than the other

Given the recursively defined function $$c$$, which I believe is a variant of the Péter-Ackermann function: $$c(m,n)=\begin{cases}0&\text{for }m=0\ n^2+n+1&\text{for }m = 1\text{ and }n\ge 0\ c(m-1, 1)&\text{for }m>1\text{ and }n=0\ c(m-1,c(m,n-1))&\text{for }m>1\text{ and }n>0\ \end{cases}$$

and the function $$d$$ that builds a “tower” of powers of $$2$$ of size $$n+2$$:

$$d(n) = \underbrace{2^{2^{.^{.^{.^{.^{2}}}}}}}_{\text{ n+2 }}$$

The inputs $$m$$ and $$n$$ are both natural numbers. I’m asked to find an $$x$$, such that for all numbers $$y \ge x$$, $$c(y,y) > d(y)$$.

I rewrote the two functions using Python in order to calculate some values:

 c(m, n):     if m == 0:         return 0     else if m == 1 and n >= 0:         return n**2+n+1              # return n^2+n+1     else if m > 1 and n == 0:         return c(m-1, 1)     else if m > 1 and n > 0:         return c(m-1, c(m, n-1))  
 d(n):     exp_num = n-1     result = 2     while exp_num != -1:         result = result**2           # result = result^2         exp_num = exp_num - 1     final_result = 2**result         # final_result = 2^result     return final_result  

Some inputs and outputs:

c(1, 1) = 3

c(2, 2) = 183

d(1) = 16

d(2) = 65536

d(3) = 115792089237316195423570985008687907853269984665640564039457584007913129639936

I believe the threshold is $$3$$, as c(3, 3) doesn’t seem to be realistically computable considering there are over 19K digit in A(4, 2) (where A is the Péter-Ackermann function). Unfortunately I have no idea how to prove this. Any help would be much appreciated.

## Given two functions, find a threshold such that one is always bigger than the other

I’ve written the following two functions in Python (they should also be fairly easy to understand as Pseudo):

 c(m, n):     if m == 0:         return 0     else if m == 1 and n >= 0:         return n**2+n+1              # return n^2+n+1     else if m > 1 and n == 0:         return c(m-1, 1)     else if m > 1 and n > 0:         return c(m-1, c(m, n-1))  
 d(n):     exp_num = n-1     result = 2     while exp_num != -1:         result = result**2           # result = result^2         exp_num -= 1     final_result = 2**result         # final_result = 2^result     return final_result  

Where the inputs m and n are both natural numbers. I’m asked to find an x, such that for all numbers y >= x, c(y,y) > d(y).

Some inputs and outputs:

c(1, 1) = 3

c(2, 2) = 183

d(1) = 16

d(2) = 65536

d(3) = 115792089237316195423570985008687907853269984665640564039457584007913129639936

As you can see d grows extremely faster than c, which I believe is a variant of the Péter-Ackermann function. How can I approach this problem? Any help would be much appreciated.