Must a creature with less than 30 feet of movement dash when effected by Symbol’s Fear effect?

The effect states:

Fear: Each target must make a Wisdom saving throw and becomes Frightened for 1 minute on a failed save. While Frightened, the target drops whatever it is holding and must move at least 30 feet away from the glyph on each of its turns, if able.

The "if able" is where I’m getting hung up. Yes, the creature is able to move 30 feet by dashing, however I’m not sure if that is intended, as it would severely limit certain PCs. If a creature only has 25 feet of movement, such as a gnome or halfling, are they forced to use there dash every turn to make that 30 feet minimum?
This was ruled in my game as no, since it meant 3 members of the party were still functional while the fourth would have been completely useless with having to dash every turn.

Exporting string with newline and tab symbols to LaTeX

We have a string that has "tab" symbol between letters "B" and "C" and "newline" symbol between letters "C" and "D":


"A B\tC\nD" 


enter image description here

The output is formatted accordingly to special symbols used.

But when I export the same string to LaTeX, the special symbols \n and \t are interpreted literally like so:


ExportString["A b\tc\nd", "TeXFragment"] 


\[\text{A b$  \backslash $  tc$  \backslash $  newlined}\] 

If you put this Latex code into some TeX file the document will display literally "A B\tC\nD" and without "tab" and "newline" symbols.

How to tell the Mathematica to export the special symbols into LaTeX accordingly?

Why do I get strange symbols in the article?

Hello guys!
I just edited the file: auto_anchor-article.dat, for example from English to Portuguese.
I did a test with an article to get the preview – minimal, and the article shows strange symbols, see image.

Those symbols are shown in the article.

I think it’s because of the accents.
My question is: will these symbols appear at the end of the campaign (articles, webs, wiki …) or does it only show in the preview?

What is the application of symbols in the cultural extension of UWP?

In Traveller-5, worldgen step E includes creating the world’s cultural extension (Cx), the last digit of which is “symbols.” The rule book explains only that:

Symbols used by the culture may range from the concrete (idol; totems; statuary) to the abstract (symbolized belief systems; group affiliations).

Given that the value is computed as Tech Level + Flux with a minimum of 1, one can easily infer that more primitive cultures have a lower value while more advanced cultures have a higher value. One also might infer from the brief description that the axis it measures has more “concrete” symbols at the lower range and more “abstract” symbols at the higher end.

How is this value applied to describing the world’s culture?

[Responses relevant to other editions of Traveller besides 5 are useful.]

Music symbols in Excel software

A Complete Guide to Chord Symbols in Music

Can we store music symbols in Excel worksheet ?.

If yes, what will be the data types for storing music symbols in cells?

Can we write functions or formulas for analysing Music symbols stored as Excel data?

What do the symbols in the header of Hunter-Net Mean?

Hunter-Net is the messageboard/list serv archive that the Imbued use in Hunter: The Reckoning. The header to the site looks like this:

enter image description here

What do the symbols (hunter code) in the header mean? The symbol on the right means "hope", but I can’t find the symbol on the left in any of the dozen or so Hunter books I own. It also doesn’t appear on the WhiteWolf fan wiki.

So what does it mean?

Why is it impossible to iterate over all TMs with $n$ states and $k$ symbols that halt after $m$ steps on $\epsilon$?

Define $ \{\sigma(n,k,m,i)\}_{i=1}^{l_m}$ an ordered set of all TMs with $ n$ states and $ k$ symbols that halt after $ m$ steps on $ \epsilon$

There are $ (2kn)^{kn}$ TMs with $ n$ states and $ k$ symbols, so $ l_m$ is always finite and so is the range of $ m$ .

If we could iterate over $ \sigma$ given $ n,k$ for all $ m,i$ , then we could decide the halting problem:

  1. Get $ n,k$ from input machine
  2. Iterate over $ \sigma$ for all $ m,i$ and check for each one if $ \sigma(n,k,m,i)$ equals the input machine, if they are equal accept.
  3. Reject.

This is odd because It seems very feasible to constract $ \{\sigma(n,k,m,i)\}_{i=1}^{l_m}$ using elementary combinatorics. Even settling on a (computable) combinatorial formula for $ l_m$ for all $ m$ given $ n,k$ will be enough to solve the haling problem since we will know how many machines are there that halt for each $ m$ , and we can simulate one step at a time for all the $ (2kn)^{kn}$ machines and compare each machine that halts with the input machine until reaching $ l_m$ for all $ m$ without a correct comparison and reject.

Is there a fact (independent of it contradicting the Halting problem) that makes it clear why there is no computable combinatorial formula for $ l_m(n,k)$ ? or am I missing some detail here?

Are there symbols representing the Feywild, the Shadowfell, elemental planes?

Are there symbols representing the Feywild, the Shadowfell, elemental planes? The player’s handbook of the 5th edition contains symbols for outer planes, are there symbols that represent the above planes of existence?

The symbol of the Feywild is of top interest. Perhaps there are any text descriptions?

How is a symbol “given meaning by a family of operations indexed by symbols”?

Practical Foundation of Programming Languages by Harper says:

Chapter 31 Symbols

A symbol is an atomic datum with no internal structure. Whereas a variable is given meaning by substitution, a symbol is given meaning by a family of operations indexed by symbols. A symbol is just a name, or index, for a family of operations.

Many different interpretations may be given to symbols according to the operations we choose to consider, giving rise to concepts such as fluid binding, dynamic classification, mutable storage, and communication channels.

A type is associated to each symbol whose interpretation depends on the particular application. For example, in the case of mutable storage, the type of a symbol constrains the contents of the cell named by that symbol to values of that type.

What does “a symbol is given meaning by a family of operations indexed by symbols” mean? Is “a symbol” given meaning by a family of operations not one of the “symbols” indexing the family of operations? What is the relation between “a symbol” and “symbols”?

What does “a symbol is just a name, or index, for a family of operations” mean? Does it mean “a symbol names or indexes a family of operations”?

When a symbol is used in each of the following example cases (which I hope you could consider as many as possible, in particular the first three cases):

  • “represent a variable in symbolic representations of equations or programs” (see the quote below),
  • “represent a word in the representation of natural language sentences” (see the quote below),
  • represent an assignable (?) in mutable storage,
  • represent something (something similar to a variable?) in fluid binding,
  • represent a class (?) in dynamic classification,
  • represent something (?) in communication channels,

how does the above quote about a symbol applies, specifically:

  • is the symbol given meaning by what family of operations indexed by symbols?
  • is the symbol just a name, or index, for what family of operations?


The Scheme Programming Language, 4th Edition, by Dybvig, says

Section 2.2. Simple Expressions

Symbols and variables in Scheme are similar to symbols and variables in mathematical expressions and equations. When we evaluate the mathematical expression 1 – x for some value of x, we think of x as a variable. On the other hand, when we consider the algebraic equation x 2 – 1 = (x – 1)(x + 1), we think of x as a symbol (in fact, we think of the whole equation symbolically).

While symbols are commonly used to represent variables in symbolic representations of equations or programs, symbols may also be used, for example, as words in the representation of natural language sentences.

Defining nullable symbols and the first set of a grammar

I’m practicing for an upcoming exam and am being tripped up by a review problem. The problem gives the following grammar:

$ $ S \rightarrow AB$ $ $ $ $ A \rightarrow \epsilon | a | (T)$ $ $ $ T \rightarrow T, S | S$ $ $ $ B \rightarrow b$ $

As far as I can tell, the only nullable symbol is $ A$ . It is the only non-terminal whose production contains the null symbol $ \epsilon$ . I don’t think $ S$ , which contains $ A$ in it’s production, is a nullable symbol since the same production also contains $ B$ , which is not a nullable symbol, and both $ A$ and $ B$ would need to be nullable for $ S$ to also be nullable. Is $ A$ really the only nullable symbol in this grammar, or am I misinformed?

As for the first set, frankly, I’m just having trouble following my professor’s notes for creating the first set. Could anyone help here or point me to a good resource for this?

Thank you all so much.