69 Matching Annotations
  1. Mar 2024
  2. Oct 2023
    1. ``` Trauma Releasing Exercises are a form of Cult Deprogramming

      [[Trauma Releasing Exercises]] (TRE) by [[David Berceli]]

      related articles: [[Tremor]], [[Quakers]] (aka "shakers"), [[Bradford Keeney]] ([[Shaking medicine]]), [[Somatic experiencing]] ([[Peter A. Levine]]), [[Ecstatic dance]], [[Runner's high]], ... (its revealing that wikipedia has no articles on these "alternative medicine" topics... all hail the cult of big pharma!)

      this association assumes that cults use [[Psychological trauma]] to imprison their slaves.

      Psychological trauma is an emotional response caused by severe distressing events such as accidents, violence, sexual assault, terror, or sensory overload.

      in every cult, there are people who want to escape. this "want to escape" starts early in childhood, where it is counteracted by punishment = by creating psychological trauma.

      Sigmund Freud's [[Psychoanalysis]] always blames "some childhood trauma" for "neurotic" behavior in adults, instead of fixing the child education, to prevent the creation of that trauma in the first place = radical solution.

      the cult slaves are expected to use their body only for working, not for sports, not for fighting, not for pleasure. all problems should be solved peacefully and intellectually ("let us talk..."). because the cult leaders know: if the slaves make too much use of their body (shaking medicine), the slaves would escape.

      also related: [[Slave morality]] is another word for [[Cult]], because the [[Public opinion]] of every cult is a form of slave morality (beautiful lies), and hard truths ([[Red pill and blue pill|red pills]]) are hidden as master morality. ```

  3. Sep 2023
    1. Theexercisesthatfollow havebeengroupedinthethreecategories already explained.Whereatransposing instrumenthasbeenrequired,thegivenopeningisprintedhereasthepartwouldbewrittenforthatinstrument;i.e.theopeningmaterialisnotatconcertpitch,butalreadyinthetransposedkey.Exercises6d,6hand6nareexamplesof thismethodwhichisdifferentfromthelayoutinMusic TheoryinPractice,Grade5,SectionI.Inwriting yourmelodiestrytoremember:1)towriteinastylethatwill suitthegivenopening;2)tokeep withinthecompassofthegiveninstrumentandtowrite idiomatically, tryingtoimaginehowthemusicwillsoundinperformance;3)toplanthestructureofyourmelody,dependingonwhatisasked(itcanbehelpfultosketchintheprincipalcadences andmodulationsbefore tryingtowrite anypartofyourcontinuation-alterationsoradjustmentscanbemadelater,ifnecessary);4)toincludenon-harmonynotes,whichwillhelpyourmelodytoflowiftheyaresuitableand well-placed;5) to consider the harmonic implications of your melodic line;6) to consider the overall shape, balance and direction of your completed melody;

      Exercises are per category. Instructions are given on how to approach melody writing. This is followed by actual exercises for the student to complete.

  4. May 2023
    1. Speed zetteling Two rows of chairs and a short time limit, students have 1-2 minutes to share their ideas (about whatever is the focus) and learn one.

      speed zetteling!

    1. 15 May homework - due by 22 May. Please download, complete, scan to PDF, and send to me via whatsapp (0768559400). Regards, John

  5. Mar 2022
    1. Exercises

      2.1.b

      Counterexample: \(\to := {(a, c), (b, c)}\)

      2.3

      \(a \to b\) iff \(a\) encodes Turing machine \(M_a\) and \(b\) encodes a valid terminating computation (sequence of states) of \(M_a\).

      2.9

      Let \(|w|_a := \varphi_a(w)\).

      \(\varphi(w) := 3^{|w|_a} 2^{|w|_b}\)

      Proof

      1. Let \(u \to_1 v\). Then \(\varphi(v) = 3^{|v|_a} 2^{|v|_b} = 3^{|u|_a+1} 2^{|u|_b-2} = 3^{|u|_a} 2^{|u|_b} \frac{3}{4} = \varphi(u) \frac{3}{4} < \varphi(u)\).
      2. Let \(u \to_2 v\). Then \(\varphi(v) = 3^{|v|_a} 2^{|v|_b} = 3^{|u|_a-1} 2^{|u|_b+1} = 3^{|u|_a} 2^{|u|_b} \frac{2}{3} = \varphi(u) \frac{2}{3} < \varphi(u)\).

      2.17

      No.

      Let \(a > b\). Then \([b^n a | n \in [0, 1, \ldots]]\) is an infinite chain according to \(>_{Lex}\).

      Note: This exercise completes the discussion of Lemma 2.4.3.

      4.2

      Let \(s, t\) be terms. Run BFS from \(s\) using \(\leftrightarrow^E\). If \(t\) is encountered, conclude that \(s \approx_E t\). If the BFS finishes enumerating the equivalence class without encountering \(t\), conclude that \(\lnot s \approx_E t\).

      4.4

      Let \(x \in Var(r) \setminus Var(l)\). Let \(p\) be a position of \(x\) in \(r\).

      Infinite chain:

      • \(t_0 = x\)
      • \(t_{i+1} = r[t_i]_p\)

      4.18

      1. a
        • Unifier: \({x \to h(a), y \to h(a)}\)
        • Matcher: \({x \to h(a), y \to x}\)
      2. b
        • Unifier: Unsolvable
        • Matcher: \({x \to h(x), y \to x}\)
      3. c
        • Unifier: \({x \to h(y), z \to b}\)
        • Matcher: Unsolvable
      4. d
        • Unifier: Unsolvable
        • Matcher: Unsolvable

      5.2

      Counterexample TRS \(R\):

      1. \(a \to b\)
      2. \(b \to b\)
  6. Aug 2020
  7. Apr 2020
  8. Feb 2020
    1. Compute the mean of every column in mtcars.
      output <- vector("double", ncol(mtcars))  # 1. output
      for (i in seq_along(mtcars)) {            # 2. sequence
        output[[i]] <- mean(mtcars[[i]])      # 3. body
      }