tavisrudd

https://x.com/__alpoge__/status/2087504785952182273 4096 unreadable chars and a shell script.
----

Lemma: four ±1 circulants of order m, row sums (2,0,0,0), ΣPAF(s) = −4 for s≠0 ⇒ the bordered Goethals–Seidel array is Hadamard of order 4m+4. 668 = 4·166+4. 

Proof: Write X for A, B, C, D and m = 166. The autocorrelation hypothesis says AAᵀ + BBᵀ + CCᵀ + DDᵀ = (4m+4)I − 4J. In the Goethals–Seidel array the R-conjugates of circulants commute, so the body Gram matrix is I₄ ⊗ (ΣXXᵀ) = (4m+4)I − 4(I₄ ⊗ J). Distinct body rows therefore have body inner product −4 within a block row and 0 across block rows.

Border the array by prefixing the four block rows with the pairwise orthogonal vectors +++−, −−+−, −+−−, +−−−. Two body rows in the same block row share a prefix, contributing +4 and cancelling the −4. Two body rows in different block rows contribute 0 in the prefix and 0 in the body. All body rows are now orthogonal, and each has norm 4m+4.

Adjoin four border rows whose blocks are constant ±1. Against a body r

tavisrudd

Initial Prompt

i want you to do detailed Rich Hickey inspired review of our architecture. what have complected? launch another inspired by John Ousterhout and a Yaron Minsky review
now shriram krishnamurthi's review ... Kmett's: then finally Casey Muratori ...

tavisrudd

See https://ai.googleblog.com/2022/11/making-traversable-wormhole-with.html for a recent advance from Google researchers using their Sycamore quantum computer.

This lead me to ChatGPT to see if it could talk sensibly about this research before the fact and in some way predict the approach used.

Tavis Rudd: Hypothetical ways to make a Traversable Wormhole with a Quantum Computer using AdS/CFT. Discuss it from the perspective of information theory and geometry

One possible approach to creating a traversable wormhole using a quantum computer and AdS/CFT is to leverage the holographic principle, which states that the physics of a gravitational system can be described by a lower-dimensional boundary theory. In the case of AdS/CFT, this boundary theory is a conformal field theory (CFT) that encodes the information about the bulk AdS space.

Using this principle, one could attempt to encode the geometry of the wormhole in the CFT, and then use the quantum computer to manipulate the CFT in order to manipulat

tavisrudd

{-# LANGUAGE ScopedTypeVariables  #-}
{-# LANGUAGE UndecidableInstances  #-}
{-# LANGUAGE FlexibleContexts  #-}
{-# LANGUAGE TypeFamilies  #-}
{-# LANGUAGE RankNTypes  #-}
{-# LANGUAGE FlexibleInstances  #-}
{-# LANGUAGE TypeSynonymInstances  #-}
{-# LANGUAGE StandaloneDeriving  #-}
{-# LANGUAGE MultiParamTypeClasses  #-}
{-# LANGUAGE ExistentialQuantification  #-}

tavisrudd

2.0 (Oct 12, 2007)
  !!!THIS RELEASE REQUIRES RECOMPILATION OF ALL COMPILED CHEETAH TEMPLATES!!!
  
  - fixed exception handling issue in the C implemenation of NameMapper 
    [patch from Eric Huss]

  - fixed filtering of #included subtemplates
    [patch from Brian Bird]

  See the release notes from 2.0b1-5 and 2.0rc1-8 for other changes since

tavisrudd

Lazy, infinite recursive sequences in Bash (like in Haskell, if you squint).

I was inspired by the beautiful Haskell zipWith implementation of the Fibonacci sequence `fibs = 0 : 1 : zipWith (+) fibs (tail fibs)`
to find an equivalent in bash using 'coroutines' and recursive pipes.

My original experiments were https://twitter.com/tavisrudd/status/367164339716751360
"fun w/ recursive pipes: e=echo;mkfifo fib;{ $e 0 1 1 >fib &};{ while read i j k; do $e $i >&2; $e $j $k $(($j+$k));sleep .4; done;}<fib>fib"

and https://twitter.com/tavisrudd/status/367142071489937408
"o=ouro;b=boros;mkfifo $o$b;e=echo; { $e $o > $o$b & }; { while read s;do $e $s>&2;case $s in $o)$e $b;;*)$e $o; esac; done; }<$o$b >$o$b"

tavisrudd

Aff
Brav Bravo
Cai
Doy Delt Delta
Eck Echo
Fay
Goff
Hoop
Ish
Jo

tavisrudd

Resources: 
http://code.google.com/p/dragonfly
http://sourceforge.net/projects/natlink/
http://tech.groups.yahoo.com/group/VoiceCoder/

Inspirations:
http://emacs-vr-mode.sourceforge.net/
http://sourceforge.net/projects/voicecode/
and especially http://shorttalk-emacs.sourceforge.net/ShortTalk/index.html from which I've stolen a few key ideas and utterances.

tavisrudd

Remapped on kinesis itself
--------------------------------------------------------------------------------
     caps lock             -> backspace (freq use)
     backspace             -> right gui/windows (freq use)
     left alt              -> return/enter (very infreq use)

     right ctrl            -> return/enter (freq use)
     right gui/windows     -> left gui
     enter                 -> right gui  (infreq use)

tavisrudd

(require 'ibuffer)
(defalias 'list-buffers 'ibuffer)

(require 'ibuffer-vc)
(setq ibuffer-formats
      '(
        (mark dss-modified vc-status-mini " "
              (name 35 35 :left :elide)
              ;; " " (mode 10 10 :left :elide)
              " " filename-and-process)