RE: WHEN WILL WEB BROWSERS BE COMPLETE? | |
2020-10-31 02:46PM | |
A follow-up. | |
There has been some great conversation around the opinion piece. Having read all | |
200+ comments on YCombinator and Gist GitHub, I think it's most productive to | |
respond to them all in this follow-up piece. | |
The piece will be structured by looking at what I think are the most relevant | |
critiques and comments, followed by adding context to others' comments, and |
# My ISP-provided fiber optical modem broadcasts a line of a poem every ten seconds. Here's the tcpdump of the complete poem. | |
# The optical modem is made by Shanghai Nokia-Bell Co.,Ltd and its model number is G-140W-UD. It's provided by my ISP, China Unicom in Shenzhen. | |
$ tcpdump -i vlan10 ether proto 0x8300 | |
15:59:00.720301 00:00:00:00:00:12 (oui Ethernet) > Broadcast, ethertype Unknown (0x8300), length 72: | |
0x0000: 0000 0000 e4ea 8386 d93c 5468 6520 6461 .........<The.da | |
0x0010: 7920 4920 6c6f 7374 206d 7920 7665 7279 y.I.lost.my.very | |
0x0020: 2066 6972 7374 2074 6f6f 7468 2c00 0000 .first.tooth,... | |
0x0030: 0000 0000 0000 0000 0000 .......... | |
15:59:10.740778 00:00:00:00:00:12 (oui Ethernet) > Broadcast, ethertype Unknown (0x8300), length 72: |
Hello Friends,
This elf begging to climb onto the web for Christmas began as a personal email, a review of Paul Graham's little Lisp Bel. He sprouted arms, legs, and in gingerstyle ran away. Arms for symbols, legs for conses: these primitives are the mark a Lisp — even more so than the parenthesis. What do we get when we remove these foundation stones: naming and pairing?
No pairs. No cons. No structure. Unordered. Chaos. Eve, a beautifully incomplete aspect oriented triple store. No need for legs when you can effortlessly transport to your destination. Lazy. Pure. Here and now, a retrospective.
No symbols. No names. No variables. Combinators. Forth. No need for arms when you can effortlessly push and pop your stack. No words. A world without words. Virtual worlds. Virtual reality. Space. Time. Motion. Action. Kinetic Programming, a proposal.
I apologize in advance. Checking my pocketwatch, I see I haven't t
import collections | |
import random | |
import re | |
import string | |
alphabet = string.ascii_lowercase | |
# Make a counter for each lowercase letter, and add a count to it | |
# whenever a letter follows it in /usr/share/dict/words | |
counters = {letter: collections.Counter() for letter in alphabet} |
http://sha256timestamp.ws.symantec.com/sha256/timestamp | |
http://timestamp.globalsign.com/scripts/timstamp.dll | |
https://timestamp.geotrust.com/tsa | |
http://timestamp.verisign.com/scripts/timstamp.dll | |
http://timestamp.comodoca.com/rfc3161 | |
http://timestamp.wosign.com | |
http://tsa.startssl.com/rfc3161 | |
http://time.certum.pl | |
http://timestamp.digicert.com | |
https://freetsa.org |