Tag: short

Can a Bloodhunter Mutant consume Mutagens towards the end of a short rest?

I’m considering playing a Bloodhunter Order of the Mutant (Updated Version). Starting at 7th Level one gains the Reconstruction Mutagen:

Reconstruction

Prerequisite: 7th level For 1 hour, at the start of each of your turns, you regain hit points equal to your proficiency bonus if you have at least 1 hit point, but no more than half of your hit points.

The Text of Mutagencraft reads as follows:

As a bonus action you can consume a single mutagen, and the effects and side effects last until you finish a short or long rest, unless otherwise specified.

Due to the 1 hour Duration of Reconstruction the effect would outlast the end of the short rest effectively pushing the number of active mutagens to 3.

Much later at Level 18 this becomes much more interesting due to Exalted Mutation

As a bonus action, you can choose one mutagen currently affecting you to flush from your system and end, then immediately have a mutagen you know the formula for take effect in its place.

Enableing you to switch the 1-hour duration mutagen to a long term one, at this point effectively enabling you to be under the effect of up to 5 long term mutagens at a time.

The Text of a short rest specifies the activities one might take during that rest:

A Short Rest is a period of downtime, at least 1 hour long, during which a character does nothing more strenuous than eating, drinking, reading, and tending to wounds.

Consuming a mutagen in my mind would count as drinking or eating something.

Am I missing something here? Is this possible? Would you allow for this in a game?

help in adapting a monster from a short story to 5E

This is the ‘Big Bad’ of the short story Undefiled, written by James M. Ward for the collection Tales of Ravenloft. From what I’ve inquired the creature in question was created by Ward specifically for the story. The monster in question (the author calls it a Coraltan) is a corporeal undead whose body is described as “desiccated and worm-infested”, however it is able to take on the appearance of a living humanoid (in this story it poses as a city’s spiritual leader) and while implied to feed on the energy of the living- in the story it seems to draw a little bit of energy from each person in a large crowd-, also appears to be capable of healing magic as well as mind-influencing magic (which it uses to keep people from its proverbial flock from discovering its true nature).

I’m not sure of the best way to simulate these qualities in 5E mechanics. At first I considered giving it the ability to cast Disguise Self at will (to appear as a living being rather than undead) except that spell has duration of an hour and is described as a wizard, sorcerer or bard spell and the monster’s healing abilities suggest divine magic- in 5E would an undead being like this be even capable of handling positive energy? Also what would be the best way to describe how it can feed on people without necessarily physically touching them?

Review my short proof that P != NP

This is hobby level work, not my job. Despite my lack of formal training, I wrote this excerpt to share some ideas about P!=NP.

The idea is to pick a problem category in Co-NP, where the correct answer is hard to verify because of circuit complexity, express it as 1-in-k SAT formula, and show there also exists a short certificate, whose length in bits is exactly twice the number of clauses. It might be true or false that all of Co-NP problems have such a short certificate in this form (Co-NP ?= NP), but I show that regardless of that, the short certificate for this problem can be made arbitrarily hard to find, because of the interleaved relationship with NP. Basically, I want to highlight a particular circular dependency between the oracles of NP and Co-NP. The argument to stomp against Co-NP = P is that no TM can hope to attack the problem of searching for the short certificate in subexponential time, because the way I define the problem makes it contain an arbitrary amount of “actual random”. Basically, it is one specific recipe to build a “monster” Co-NP problem from a simple certificate.

Now I have many questions for anyone with more formal training than me:

  • Has this category of problem been expressed with a different name?

  • Is this an obvious dead end or unexplored?

  • How can I express the same ideas but more formally against TM capabilities?

Meaning of short English phrases

Fourth generation programming language is more advanced than traditional high level programming language because they use command, which are more like short English phrases.

Question is- English phrase is understood. Why short is added?

What is the basic meaning of short in this context?

Can I short two outputs of a decoder?

In the image I have a 3×8 decoder with input lines 10 11 and 12 . I want a 2×4 decoder in my circuit.Can I use this 3×8 decoder for the job by shorting it’s outputs as shown in the image . For example for the first code 00 at input line 12 and 11 , depending on value of line 10 , either o1 or o2 of decoder will be high . I short them to produce first output of 2×4 decoder i-e., D1 in the image . At code 00 D1 will be high because either o1 or o2 is high .Same logic for other outputs .enter image description here