## example of bad case for perptron algorithm

I am trying to think of an example using 3 data points where the margin produced by a perceptron algorithm can be arbitrarily bad. But I got stuck on how to approach this example.

## What is a make sense (meaningful) example of language that an unrestricted grammar could generate?

I have learned that:

1. Unrestricted grammar is used to define (or describe) a formal language.
2. Unrestricted grammar is used to define recursively enumerable set [https://en.wikipedia.org/wiki/Recursively_enumerable_set][1].

I’d like to find a meaningful example for #1 case which is similar to below context sensitives grammar example to learn the purpose of unrestricted grammar. I could find a meaningful example for context sensitives grammar but I could not find a one for the unrestricted grammar yet. Could you help me?

Language for “Network racing game record” with below record instances:

Mr. Bean Male Player 1

Ms. Emma Female Player 2

Mr. Hải n/a Computer 3

Ms. Tú n/a Computer 4

Production rule:

S ⟶ Title Name TAB Sex UserType TAB Rank

Title WomanName ⟶ "Ms. " WomanName

Title ManName ⟶ "Mr. " ManName

WomanName TAB Sex "Player" ⟶ WomanName TAB "Female" "Player"

ManName TAB Sex "Player" ⟶ ManName TAB "Male" "Player"

Name TAB Sex "Computer" ⟶ Name TAB "n/a" "Computer"

Name ⟶ WomanName

Name ⟶ ManName

Sex ⟶ "Male"

Sex ⟶ "Female"

UserType ⟶ "Player"

UserType ⟶ "Computer"

Rank ⟶ "1"

Rank ⟶ "2"

Rank ⟶ "3"

Rank ⟶ "4"

WomanName ⟶ "Emma"

WomanName ⟶ "Tú"

ManName ⟶ "Bean"

ManName ⟶ "Hải"

TAB ⟶ "\t"

## Can you give an example of a problem in \$EXP^{RE}\$ but not In \$P^{RE}\$

Can you give an example of a problem in $$EXP^{RE}$$ but not In $$P^{RE}$$?

## Are My Answers to This Hamming Code Example Correct?

I have attempted to answer this question on Hamming code but i am very new to it and would appreciate feedback on my answers, Thank you!

## Is this example in Skiena’s Algorithm Design Manual correct?

i think the above is incorrect; specifically, i think `H` isn’t bijective. say our alphabet is the lowercase letters `[a-z]` and that `char(a) = 0`. then, e.g., `H("abc") = H("bc")`.

am i missing something?

## what is an example of out of bounds read in order to leak sensitive information?

I Am trying to understand a little bit better behind the scenes on bypassing aslr by reading the bytes in the memory of a process, but how can I make an example of an info leak in WIN32? my code does the leaks of bytes , but how can I check the image base based on those bytes?

``#include <stdio.h> #include <string.h>  int main(int argc, char **argv) {     char a[16];      strncpy(a, "0123456789abcdef", sizeof(a));      //... lots of code passes, functions are called...     //... we finally come back to array a ...      printf("%s\n", a); } ``

## Worked out example of Slepian-Wolf Theorem

Note: First posted this on Theoretical Computer Science Stack Exchange, but deleted it from there since it seems to be off-topic.

The Slepian-Wolf theorem states that sequences of outputs from two separate random variable sources A and B that have a joint probability distribution defined on them, if encoded with the following rates, can be completely retrieved when decoded together:

$$R_A \geq H(A|B) \ R_B \geq H(B|A) \ R_A + R_B \geq H(A,B)$$

$$R_x$$ refers to the bits required for encoding one symbol of $$X$$, assuming all logarithms are taken to the base 2.

Given this, I wanted to try out an example, especially because I find fractional number of bits per symbol slightly confusing to think about.

Consider two sources $$A$$ and $$B$$, that either sprout out 0 or 1 following this probability distribution:

`A \ B` ` 0 `` 1 `
` 0 ` ` 0.5 `` 0 `
` 1 ` ` 0.25`` 0.25`

We calculate the entropies as follows: $$H(A,B) = 3/2 = 15/10\ H(A|B) = 7/10 \ H(B|A) = 1/2 = 5/10\$$

Now, assume that the a certain sequence of bits that A and B give out are as follows:

` A `` B `
` 0 `` 0 `
` 0 `` 0 `
` 1 `` 0 `
` 1 `` 1 `
` 1 `` 0 `
` 0 `` 0 `
` 0 `` 0 `
` 1 `` 1 `
` 1 `` 0 `
` 0 `` 0 `

I should be able to find an encoding that allows A to send atleast 7 bits, B atleast 5 and a total of atleast 15, such that they can be decoded completely, right?

Unfortunately I am unable to think of an encoding where they send less than 10 bits each.

For example, B does not have to send anything when A sends 0, however B does not know when A sends 0.

I would also like to know if this is the wrong way to interpret the theorem (perhaps a longer sequence is required), or if there is another way to see its working.

## why we need pipeline registers in pipeline processor ( as for example for MIPS processor )

I think the answer because the data of an instruction can be overridden by the data of the instruction that will be fetched after it , but I think the data of the first instruction will always be ahead ( in one stage further of the data of the next instruction ) since the data is always passed to the next stage at the clock edge so I think there will be no collision between the data of instructions ? Please someone explain using a small example to get the idea . Many thanks.

## How do I colour a mesh in Kiss3d? (code example request)

This is a question about the sebcrozet/kiss3d graphics engine. I have managed to create a mesh using `group.add_mesh()`. Now I want to colour my mesh with a specified colour for each vertex (or face). Does anyone know how I do this?

One possible approach seems to be to define a `RgbImage` with all my different colours somewhere in the image, turn that into a `DynamicImage`, turn that into a `Texture`, somehow associate the texture with the mesh, set up a UV map, and set the UV location for each vertex to map to the relevant colour.

The documentation does not go into enough detail or give a specific example. Does anyone have any example code that works?

## Can 2 different martial fighting styles used together at the same time? for example protection and defense from a fighter champion lvl 10+

A champion fighter gets a second fighting style at 10th level. Can the 2 different martial fighting styles be used together at the same time? For example protection and defense from a champion fighter, would it gain both bonuses?