## Turning the Mystic’s Baleful Transposition into a spell; what level should this be?

The UA Mystic can get the Baleful Transposition feature, which states:

As an action, choose one creature you can see within 120 feet of you. That creature must make a Wisdom saving throw. On a failed save, you and that creature teleport, swapping places. This ability fails and is wasted if of you can’t fit in the destination space.

As far as I could find, this is the only way to actually trade places with an opponent, and that is something I find incredibly interesting. I was wondering then what level this would be if I made it into a spell, something like the following:

# Forced Teleport

X-th level some school

Casting Time: 1 action
Range: 120 feet
Components: TBD
Duration: Instantaneous
Classes: TBD

Choose one creature you can see within range to make a Wisdom saving throw. On a failed save, you and that creature teleport, swapping places. This ability fails and is wasted if of you can’t fit in the destination space. A willing creature can choose to fail their saving throw.

What level should this spell be?

It doesn’t seem particularly strong to me; it combines moving yourself (like misty step), with moving the enemy (like thorn whip) but both are limited in various ways, though with a much greater range.

Alternatively, if this spell simply shouldn’t exist in D&D 5th edition for some reason, then that would be an acceptable frame challenge.

## How permanent are these changes to a PC when they attune to this weapon in Descent into Avernus?

In Baldur’s Gate: Descent Into Avernus, on pages 226-227, the

is described. The weapon is listed as a

and has the following property (given a bold italics header):

Briefly, these traits include (give bold headers):

The next header is written in bold italics, so I believe this is a new property that is unrelated to the Attunement property.

My question is about the part that says:

As I understand it, this means that you are permanently given all of the various traits, regardless of whether you remain attuned to the weapon or not, or whether or not

Is this interpretation correct? Does that even mean that an entire party could pass the weapon around (assuming that

and all gain these traits, even if

forever afterwards?

## How to translate automaton (Turing machine) into the program of high level programming language?

Every program in high level (“industrial”) programming language can be expresses as some Turing machine. I guess, that there exists universal algorithm for doing that (e.g. one can take the Cartesian multiplication of the domains of all the variables and the resulting space can be the state space of the Turing machine, though the handling of computer-representable floats can be a tricky – is there such general algorithm or system that does that? https://github.com/Meyermagic/Turing-Machine-Compiler is example for the programming language for Turing machine and for the transpiler that translates C programs into the language of Turing machines or see https://web.stanford.edu/class/archive/cs/cs103/cs103.1132/lectures/19/Small19.pdf for some kind of Turing assembler language). But what about the other direction – can Turing machine be rewritten in conscise program in high level programming language that uses functions, compositionality of functions and higher-order functions?

Of course, there can be infinite results to that conversion – staring from the naming of the variables and functions and ending with the data structures, content of functions, etc. But there are metrics for the quality of the software code and maximizing such metrics can result ir more or less unique answer to this stated problem.

Such conversion is very actual in the current context of reward macines for the reinforcement learning (e.g. https://arxiv.org/pdf/1909.05912.pdf) – symbolic representation of the reward function (as opposite to tabular or deep neural represenation). Such symbolic representation greatly facilitates skill transfer among different tasks and it introduces the inference during the learning process and in such way reward machines reduces the need for data and need for learning time.

One can say that the extraction of first order and higher-order functions is quite hard tasks, but this task is being tackled by the higher order meta-interpretative learning, e.g. https://www.ijcai.org/Proceedings/13/Papers/231.pdf.

So – are there research trends, works, results, frameworks, ideas, algorithms about conversion of the Turing machine into program in high level programming language (and possibly back). I am interested into any answer – be it about the functional, logic or imperative programming.

## Does quantum computing convert any O(2^n) algorithm into a polynomial running time and how?

For example, if it is a $$O(2^n)$$ algorithm that loops through 0 to $$2^n – 1$$ and check whether the number of 1 bits is divisible by 3, 5, 7, 9, 11, does quantum computing reduce it to non-exponential time and how?

## Adding two 4 bit binary numbers into 2 7 Segment LED up to 30 [closed]

I am trying to build a 2 bit binary adder into 2 7 segment LED’s up to 30 and I’m having trouble getting passed nine as I believe there need to be an overflow but I am not sure. Was hoping to get some help with this.

## A technician injected malware into my computer without my knowledge

So this fixer that I asked to fix my busted front audio ports injected my PC with KMS-R@in in order to get rid of the activate windows watermark without my consent/knowledge, and it gave me Floxif.E and Floxif.H, and updated the drivers to fix the back ports, which wasn’t even what I asked him for, is there any legal action I can do to make him take responsibility?

By the way, his store’s affiliated with/backed by ASUS.

## What’s the cheapest, good way for someone to try getting into painting miniatures?

I want to try painting miniatures (plastic ones ala Castle Ravenloft and the World of Warcraft board game), but I don’t want to spend a lot of money on supplies only to find out that I stink, but I also don’t want to get low quality paint only to find out that I enjoy painting them.

I’ve seen many posts online where people recommend using Vallejo paints or Citadel or Reaper’s paint lines, but they all seem expensive at more than \$ 3 a pot. Is there a cheaper brand that I can experiment with?

Locally, the two craft stores (no real hobby stores in the area) both carry Testor’s brand paints. I’ve read online that Testor’s is not good for miniature painting.

I don’t know how old this site is, but he recommends not spending more than \$ 1.50 for a pot of paint.

Is there a way to ease my way into miniature painting so I can see if it’s a good fit, or do I need to just bite the bullet and spend \$ 100 on supplies?

## How much experience is needed when I multiclass into a new class?

How much experience is needed to take my first level in a new class in D&D 5e? I’m interested in going from 4th level Sorcerer to 1st level Cleric. Is the experience point cost the same as normal levelling?

## Can a rogue multiclass into druid?

My young son is stuck playing a 4th level rogue when he really wants to play a druid. He inherited the character from me when he joined the game and the GM is saying he can’t swap* (the same GM who said my cleric can’t use a sword because they couldn’t in d&d v1)

So are there any good reasons why he can’t take druid levels from now on according to rules as written? Are there any features of the 2 classes that would just clash so badly as to make the char virtually unplayable.

Stats: str:10, dex:15, con:15,int:12, wis:9

* he could swap but would need to come in as level 1 which is really hard in an adventure written for level 4 players.

## Why maximum-matching algorithm falls into the category of fill-reducing algorithms?

My understanding is that “maximum matching” (or “maximum transversal”) are algorithms to pre-order matrix to increase the numerical stability. In Timothy Davis’ book Direct Methods for Sparse Linear Systems, 2006, however, this algorithm is put in Chapter 7 which is titled “Fill-reducing ordering”. In his more recent paper A survey of direct methods for sparse linear systems, 2016, maximum matching was also placed in section 8 which is titled “Fill-reducing orderings”.

So far, my had an impression that reordering algorithms can be categorized into 3 classes:

• for numerical stability: maximum transversal, etc
• for fill-reducing: AMD, etc
• for work-reducing or parallelism-increasing: BTF, BBD, etc

I have problems in understanding putting above 3 classes into a single category called fill-reducing…