bollu / bollu.github.io Goto Github PK
View Code? Open in Web Editor NEWcode + contents of my website, and programming life
Home Page: http://bollu.github.io/
code + contents of my website, and programming life
Home Page: http://bollu.github.io/
https://bollu.github.io/level-set-of-a-continuous-function-must-be-closed.html
http://bollu.github.io/take-at-most-4-letters-from-15-letters.html
http://bollu.github.io/blazing-fast-math-rendering-on-the-web.html
http://bollu.github.io/hairy-ball-theorem-from-sperners-lemma-wip.html
https://github.com/bollu/bollu.github.io/blob/master/todo.md
Notice that there is <<<<< HEAD
things
https://bollu.github.io/words-to-know-in-target-language.html
What is the t variable really tracking?
The t variable is the type of the array. In the Incunabulum there are only 2 types: unboxed, and boxed. See https://www.jsoftware.com/papers/AIOJ/typedefA.htm
How does one create a multi-dimensional array easily?
d=3,2
a=d#~6
What are some interesting programs one can run with this mini-interpreter?
Not any that couldn't be run with any other APL. Imo, the main value of the Incunabulum is just how it works.
https://pixel-druid.com/articles/precision-recall-and-all-that.html
Hi! I am the editor of Haskell Weekly. An issue from a couple weeks ago (https://haskellweekly.news/issues/92.html) featured your most recent blog post. I would like to be notified when you write a new post, but as far as I can tell your blog does not have a feed. Would you mind adding an Atom or RSS feed? Thanks!
https://bollu.github.io/nilradical-is-intersection-of-all-prime-ideals.html
http://bollu.github.io/everything-you-know-about-word2vec-is-wrong.html
http://bollu.github.io/a-hackers-guide-to-numerical-analysis.html
My theory is that
2 2#~4
should produce a 2x2 matrix. It is only a theory, since I am so far unable to run the interpreter without it crashing. It seems to me that #
is the APL "rho" operator and ~
is the APL "iota" operator.
Referring #computing-equivalent-gate-sets-using-grobner-bases
.
The problem is a system of linear equations with 2^n - 2
variables a
, axorb
, axorc
, etc. and 2^n - 1
equations (2^n
equations with trivial 0 = 0
equation): 1*a + 1*b + 1*axorc + 1*bxorc = 1 (mod 8)
for (a, b, c) = (1, 1, 0)
etc.
For example n = 3
:
A =
[1 0 1 0 1 0]
[0 1 1 0 0 1]
[1 1 0 0 1 1]
[0 0 0 1 1 1]
[1 0 1 1 0 1]
[0 1 1 1 1 0]
[1 1 0 1 0 0]
b = (0, 1, 1, 0, 1, 0, 0, 1)
I know nothing about Sage but I implement this: https://gist.github.com/pcpthm/9bf91ed750cb2b4abc4009475680d908.
Linear equation on integer (not necessary prime) modulo ring can be solved by modified Gaussian eliminations in O(N^3)
time where N
is size of matrix ~ 2^n. This is still exponential in term of n
but considerably faster / less power. Probably specialized algorithm can be implemented via FFT-like or something with O(N^2 * poly(n))
runtime.
Perhaps the matrix can be analyzed to get the idea of general solution.
https://bollu.github.io/topology-is-really-about-computation-part-1.html
All the formulae are rendered twice. This is making the writing very unreadable
What is the t variable really tracking?
Each value is either an array of numbers (t==0) or it is an array of boxes (t==1).
So t
is the type of the scalars that make up the array.
The monadic box operator <
converts a value into a box.
IMO, since I still don't understand all of the code.
Given an array of qubits xs: Qubit[], I want to switch to little endian. Due to no-cloning, I can't copy them! I suppose I can use recursion to build up a new "list". But this is not the efficient array version we know and love and want.
The code that I want to work but does not:
function switchEndian(xs: Qubit[]): Unit { for(i in 0..Length(xs) - 1) { Qubit q = xs[i]; // boom, this does not work! xs[i] = xs[Length(xs) - 1 - i] xs[Length(xs) - 1 - i] = q; } }
You just need a linear swap function.
function switchEndian(xs: Qubit[]): Unit {
for(i in 0..Length(xs) - 1) {
swap(xs[i], xs[Length(xs) - 1 - i]);
}
}
https://bollu.github.io/counterexample-to-fundamental-theorem-of-calculus.html
https://bollu.github.io/sam-harris-and-jordan-peterson-vancouver-1-todo.html
A declarative, efficient, and flexible JavaScript library for building user interfaces.
๐ Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
An Open Source Machine Learning Framework for Everyone
The Web framework for perfectionists with deadlines.
A PHP framework for web artisans
Bring data to life with SVG, Canvas and HTML. ๐๐๐
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
Some thing interesting about web. New door for the world.
A server is a program made to process requests and deliver data to clients.
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
Some thing interesting about visualization, use data art
Some thing interesting about game, make everyone happy.
We are working to build community through open source technology. NB: members must have two-factor auth.
Open source projects and samples from Microsoft.
Google โค๏ธ Open Source for everyone.
Alibaba Open Source for everyone
Data-Driven Documents codes.
China tencent open source team.