Applying templates to lion shaman Wildshape

I have a level 11 Lion Shaman druid. I like to wildshape into lion forms for obvious reasons… he’s into lions.

So for lion shamans, my level 11 guy can shape into lions like a level 13 druid. I believe that kind of maxes out with huge animals with Beast Shape III.

Is there a way I can apply different templates to this lion, like giant for instance, to maximize my wildshape capabilities?

Issues Applying Selections to Hierarchical Datasets

I have a large dataset in the format below. I’m able to graph them as polygons easily enough, but am having trouble doing fine selections of the coordinates in Dataset format for further checks and processing. (I have other functions downstream that do geographic intersections that are being thrown off.) Some days I feel like I’m finally starting to understand Mathematica dataset operators, and other days I’m just confused.

ds = {{<|lat -> 49.275, lng -> -123.03|>, <|lat -> 49.2753, lng -> -123.03|>, <|lat -> 49.2753, lng -> -123.03|>, <|lat -> 49.275, lng -> -123.03|>, <|lat -> 49.275, lng -> -123.03|>}, {<|lat -> 49.275, lng -> -123.029|>, <|lat -> 49.2753, lng -> -123.029|>, <|lat -> 49.2753, lng -> -123.029|>, <|lat -> 49.275, lng -> -123.029|>, <|lat -> 49.275, lng -> -123.029|>},  {<|lat -> 49.275, lng -> -123.029|>, <|lat -> 49.275, lng -> -123.029|>, <|lat -> 49.2753, lng -> -123.029|>, <|lat -> 49.2753, lng -> -123.029|>, <|lat -> 49.275, lng -> -123.029|>}} // Dataset 

I have a simple check that I wanted to break out because I will probably add complexity later. I thought applying it to the dataset would be straightforward but nothing is being returned from the several configurations I’ve tried. I thought I was following the "Select Elements from Dataset" doc closely, but I’m still not connecting what’s written there to the behaviour I’m seeing in this example. I assumed the operators would take the little mini-dataset polygon as input but I assume something else is happening instead.

testcoords[shape_] := shape[Min, "lat"] > 40   testcoords[ds[[2]]]. (* true *)  ds[Select[testcoords]]  (* returns empty Dataset *)  ds[All, Select[testcoords]]  (* returns {} ... *) 

How can I configure a selection operator to check each polygon?

Applying XP to a pre-created adventure with milestones?

I have bought my first DnD adventure, Dragon of Icespire Peak, mainly because I wanted a good opening adventure to introduce some new players to the game.

However the module uses milestone leveling with clear advice to increase to level 1 after quest 1 and then increase based on the successful completion of quests thereafter.

I am planning on this to be an opening intro to a wider campaign I have planned and have tweaked the setting accordingly however I generally run my campaigns based on experience points, largely because I run a very open world players can do anything including ignore the main story, type of campaign. I don’t have anything largely against the way players will level through the adventure but I don’t want them to get to level 5/6 and then suddenly start handing out XP as we move into my own material.

Are there any clear rules to converting the milestone based adventures into XP style games? I can easily work our roughly how much XP the various monsters will return and then work out what completing the quests/role playing bonus should give to allow the players to advance at roughly the same pace but are there any official suggestions as to how to do this?

Just to add some clarity, I will be running for 6 players, and these are mainly new players so I want to be able to use XP to reward role playing and good gamesmanship as well as just completing the quests and killing stuff.

what is the relevance of computability when applying diagonallization?

When thinking about diagonalization, I’ve always glossed over whether or not the enumeration, or the diagonal is computable or not. When does it matter?

Say for example, that have an enumeration of the rational numbers in an uncomputable order, then we would have to assume that either an uncomputable enumeration of the rationals doesn’t exist, or the diagonal gives an uncomputable number?

Or suppose that we had an enumeration of a countable but non-recursive set. Would diagonalization produce an uncomputable number?

Or if we assume that we have a computable enumeration of the computable real numbers, and we do diagonalization on it, then we would have to assume that the number on the diagonal is uncomputable? Something seems wrong here.

In general, what are the catches when doing diagonalization pertaining to computability?

Applying “principle of least privilege” when it comes to execs and owners of the company – should they automatically get all permissions if requested?

As an administrator of certain systems in a company I understand and adhere to the “principle of least privilege” — which I’m assuming I don’t need to repeat its definition here, so let’s just say people here get given access to systems only in accordance with what they need for their role and no more. I follow that principle and check carefully whether they can have read-only access in order to carry out the role and if so I give read access only, etc.

I had a request from an executive-level (C-suite) person (“Jack”, let’s say) who is actually one of the five co-owners of the company, to get blanket “sysadmin” level access to a particular system. (I am confident the request has come from Jack himself and isn’t a hacking or phishing attempt, as I verified it with Jack directly.)

Jack is far too important and involved with strategic stuff to need to carry out any day-to-day work with this system, especially anything that would need sysadmin level access, but occasionally wants to get involved in “poking around” in there, as he is technical by background.

I get the sense that he doesn’t like the idea that he is “walled off” from some system although he owns part of the company.

I’m not asking about the interpersonal aspects about this, just the info-sec ones.

Is it accepted info-sec practice to give an owner of the company “sysadmin” access and by doing bypass the “principle of least privilege”? — since, after all, Jack (partly) owns the company so it’s all his stuff anyway!

Or should that still apply, and even the CEO shouldn’t have write-access to a system when they don’t need it as part of their job function?

Applying overlapping skills to reduce difficulty in Numenera

I know in Numenera you can apply maximum of 2 difficulty reduction from a skill check. Is there any guidance on applying overlapping skills? Some examples:

  • Character tries to identify plant people. They’re trained at plants and animals (two separate skills), thus reducing difficulty by 2.
  • They try to to dash and jump. They’re trained in athletics and jumping (again, separate skills), -2 difficulty.

Applying rules to functions with non numeric arguments

I am trying to do the following (it’s a simplified version):

In[1]:= rulepositive = { f[a_?Positive]:> f[a] }; In[2]:= rulenegative = { f[a_?Negative]:> 0 };  In[3]:= $  Assumptions = Elements[w,Positive];  In[4]:= f[w]/.rulepositive In[5]:= f[w]/.rulenegative 

where I expect

Out[4]:= f[w] Out[5]:= 0 

But it doesn’t work. In words I want to apply a set of mapping rules in functions with non numeric arguments, which nevertheless have definite nature (e.g. Positive/Negative). How could I do it?

Applying the Parameter Theorem to show that a function is not computable


Show that $ g: \mathbb{N} \to \mathbb{N}$ such that $ $ g(x)=\begin{cases} 1 & \text{if halt}(2833,x) \ 0 & \text{otherwise} \end{cases}$ $ is not computable.

We know that

$ $ g(x)=\begin{cases} 1 & \text{if }\Phi_x(2833)\downarrow \ 0 & \text{if }\Phi_x(2833)\uparrow \end{cases}$ $

How can I use the parameter theorem to reduce $ g$ to $ \text{halt}(x,x)$ ? I’m very confused.