Deadhand Style Feat Function

As written, this feat has some undefined qualities and I’m interested in knowing more specific details. As of right now, I am unaware of any errata or comments from the devs’ that clarify.

Deadhand Style, from Horror Adventures

Benefit(s): While using this style, if you have at least 1 point in your ki pool, you gain a +2 bonus on saves against fear effects, and the DC of Intimidate checks against you increases by 4. As a swift action, you can spend 1 point from your ki pool to empower your unarmed strikes. Creatures hit with your unarmed strikes must succeed at a Will save (DC = 10 + 1/2 your character level + your Wisdom modifier) or become shaken for a number of rounds equal to your Wisdom modifier. This is a mind-affecting fear effect.

I heave two questions about this feat. The first is, how long do your unarmed strikes stay empowered for? A single strike, a round, a minute, for as long as you maintain the style, longer?

Secondly, will hitting a creature multiple times cause an increase in severity of the fear condition? Most effects that cause fear will list specifically that they don’t, but there’s also the general no stacking rule, so I’m unsure.

Failed Re-Verification (Test Again) Function

It’s been a while, but i was wondering again if this could easily be implemented.
Just an option to re-verify Failed Re-verification list on that list popup.
A while ago I was planning to make a batch file to use to do SOMEthing. Can’t exactly recall what…
Maybe it was saving the verified list BEFORE manually running Re-Verify  links so that after re-verification, I could match to see which were removed, and place them back in Verified right before I manually re-verify next time,  to be checked again?
I think I did this mnaually but it lost the other data fields…
Looking on GSA posts; I know I did mention it here.

Showing that the quotient function is primitive recursive

I’m asked to show that the quotient function is primitive recursive. I know that the operation of integer division $ div$ is not total, as it is not defined when the denominator is zero, and a recursive function has to be total by definition.

So I could give a function $ div’$ and define a value for the case that the denominator is zero: $ div'(x,y) = 0$ if $ y = 0$ , otherwise $ div'(x,y) = div(x,y)$ . But this is still not primitive recursive because of $ div$ . How can I go about proving that the quotient function is actually primitive recursive? Should it somehow be built from scratch? Any help would be appreciated.

Do any programming language function calls internally call Operating system APIs?

To list directory content in Python we use os.listdir(), In Java we use Files.list(new File(dirName).toPath()). Like this we use a lot of functions calls, eg: For Network connectivity, Print in screen, Save to files.

In all operating systems do these all language-specific function calls ultimately call OS APIs (In Windows I think it will be Win32 APIs)?

ANything we can do without call OS APIs?

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.

ERROR: structure of query does not match function result type

   CREATE OR REPLACE FUNCTION "cem_dashboard"."n_performance_value"("city" character varying, "testdate" character varying, "technology" int4, "param" character varying)       RETURNS TABLE("sim_network_operator_code_a" float8, "client_city" text, "signal_cell_type_a" float8, "test_date" text, "data_value" float8) AS $  BODY$       BEGIN         IF param = 'download' THEN             RETURN QUERY SELECT cem_dashboard.network_performance.sim_network_operator_code_a,network_performance.signal_cell_type_a,network_performance.test_date,sum(network_performance.download_kbps) as download_kbps FROM network_performance WHERE cem_dashboard.network_performance.client_city = city AND cem_dashboard.network_performance.test_date LIKE testdate AND cem_dashboard.network_performance.signal_cell_type_a = technology GROUP BY cem_dashboard.network_performance.sim_network_operator_code_a,cem_dashboard.network_performance.signal_cell_type_a,cem_dashboard.network_performance.test_date;         ELSIF param = 'upload' THEN             RETURN QUERY SELECT cem_dashboard.network_performance.sim_network_operator_code_a,network_performance.signal_cell_type_a,network_performance.test_date,sum(network_performance.upload_kbps) as upload_kbps FROM network_performance WHERE cem_dashboard.network_performance.client_city = city AND cem_dashboard.network_performance.test_date LIKE testdate AND cem_dashboard.network_performance.signal_cell_type_a = technology GROUP BY cem_dashboard.network_performance.sim_network_operator_code_a,cem_dashboard.network_performance.signal_cell_type_a,cem_dashboard.network_performance.test_date;         ELSE             RETURN QUERY SELECT cem_dashboard.network_performance.sim_network_operator_code_a,network_performance.signal_cell_type_a,network_performance.test_date,sum(network_performance.latency) as latency FROM network_performance WHERE cem_dashboard.network_performance.client_city = city AND cem_dashboard.network_performance.test_date LIKE testdate AND cem_dashboard.network_performance.signal_cell_type_a = technology GROUP BY cem_dashboard.network_performance.sim_network_operator_code_a,cem_dashboard.network_performance.signal_cell_type_a,cem_dashboard.network_performance.test_date;         END IF;      END; $  BODY$         LANGUAGE plpgsql VOLATILE       COST 100       ROWS 1000 

I want to make a function with the contents if conditional. In if conditional, I insert a sql query where the sql has special conditions according to the parameters given, but I am confused about how to return it.

Please help me 🙁

sorry if my english is bad, I use google translate