Moyamo

A refinement of (1) would be Harberger Taxes[0].

1. When a person registers a name they declare a price they are willing to sell the name for. They can update their price at any time.

2. They pay an annual tax (about 1% to 5%) for the right to keep the name.

3. If someone is willing to buy the name for the declared price they are forced to sell the name to them.

This system has the advantage that the person who values the name the most will get to keep it, and the person who lost the name will be fairly compensated.

[0] https://www.law.nyu.edu/sites/default/files/upload_documents... (See the bottom of page 39 in particular)

The problem I'd have with that is that I'd never be able to commit to a fixed set of areas or categories since the type of work I do is constantly evolving. Plus I've always had trouble creating mutually exclusive categories.

What works well for me is to keep all things I'll need soon in the top level of my documents folder and when I'm done with it I move it into an archive folder.

This way my documents folder has few files and folders in an easily accessible flat heirarchy. While old files can be easily searched for in the archive folder.

Using /tmp for my downloads folder became problematic for me when downloading big files.

1. You may want to pause the download and restart it after reboot.

2. It's quick to redownload small files but a pain to have to redownload large ones.

3. Arch puts /tmp on a tmpfs, so big files can eat all your memory!

- ~/docsync: Files I edit on a daily basis and is synchronized with Syncthing to all my devices. I put all projects I'm currently working on in the top-level of this folder except for the categories below. Archived projects are zipped and then put in ~/docsync/old

Categories:

- ~/docsync/accounts: Accounting stuff

- ~/docsync/audiobooks

- ~/docsync/books: All my PDF books

- ~/docsync/dotfiles: git controlled dotfiles.

- ~/docsync/Pictures

- ~/docsync/Music: Lossy compressed music.

Other folders in home directory

- ~/hq-media: Mostly FLAC audio

- ~/git: Clones of other people's git repos

- ~/srv: File shares other than docsync.

- ~/Mail: offline copies of email

- ~/tmp: temporary stuff I'll probably don't want to keep.

- ~/Downloads: Random stuff I've downloaded

Anecdotally, I have found that Brave chokes on some obscure websites (i.e. it won't play video or audio).

In html the link comes first <a href="link">Link Text</a>. So I would bet that most people are more comfortable with the link coming first.

> what's the advantage over asciidoc?

Exactly what is states in the article.

Asciidoc has 3 different types of headings (prefix, pre-postfix and underlined).

    http://example.com[Text]	  

The form is simple but for complex URLs, the [Text] might look like being part of the URL itself. Not beautiful but at least something I could live with.

Additionally asciidoc uses ===== for underlining headings and for delineating code blocks.

the other small disadvantage is that text isn't really bound to headers

Surely this is true of all markup languages. How you would represent this visually in a document?

I've noticed this as well, do they even encrypt the backups the upload to google drive and if so with what key? If they use one key then the advantages of perfect forward and perfect future secrecy that the double-ratchet protocol provides is lost.

status.net isn't dead. It turned into GNU Social which is alive and well. https://gnu.io/

This is interesting. If Microsoft are switching to rolling release, how will they roll out big updates like major UI changes?

Since they are also offering a free upgrade for Windows 7 and 8 users I think Windows 10 will be the next XP.

Does anyone know any details happened? The answer doesn't seem to provide much information.

I've heard of something called Liskell and Lisk (two different projects). I haven't tried either of them, so I don't know if they are usable.

They are probably trying to localise the site using GeoIP. IT could be a problem if you're using a proxy like Tor.

No matter whose name a put in I seem to get an error

    Either the tweets from id_aa_carmack are not publically accessible
    or there are too few words in them to analyze.

I agree with all your points.

One of my main gripes with Common Lisp is its complexity. When I started learning Lisp, I expected to find a beautiful and elegant language, one without a need for syntax. The way C is almost an elegant assembly. Maybe I should have tried Scheme instead.

Common Lisp is anything but elegant. Instead of a regular syntax, you get all these "mini-languages", like the format syntax e.g.

    (format t "~{~a~^, ~}" '(1 2 3))
    ; prints out
    ; 1, 2, 3

This works fine for list, but not for vectors, which is a problem, since I needed vectors often (for random access).

The loop macro is also quite powerful and complicated. e.g.

    (loop :for i :from 1 :to 1000 :collect (* i i))

will create a list of square of 1 to 1000. The loop macro can become really convoluted, not at all simple.

The fact that Common Lisp is a Lisp-2 makes treating functions as first-class as rather awkward. I could never remember when I needed to prepend a lambda with #'.

This article may be of interest http://xahlee.info/comp/Common_Lisp_quotations.html

I found much of the elegance I was expecting in Haskell. But maybe Scheme is a better lisp.

I think the parent comment about VMs was aimed at clojure.

No it's not. It is only superficially[1].

The sieve of Eratosthenes goes like this:

1) Mark 2 as prime. Let it be n.

2) Mark all numbers of the form i times n as composite, where i is a positive integer. (We can do this by stepping over multiples of n. No multiplication needs to take place.

3) The next unmarked number is prime. Let it be n. Goto 2

Notice how this alogorithm does not use division. Division in modern CPUs is slow.

The algorithm presented uses the `mod` operator, which does division. This algorithm is equivalent to the Trial Division Algorithm. Instead of "deleting" multiples of n as composite, this algorithm tests all numbers greater than n for divisibilty by n, and then only does it "delete" the number.

For a more detailed explanation, see http://www.cs.hmc.edu/~oneill/papers/Sieve-JFP.pdf

[1] https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes#Trial_di...

Even though, the ruby one-liner seems more legible, it is a lot longer (and probably a lot slower).

In this case I don't see what's wrong with the sed, awk or grep commands (fast and short).

To explain how they work

    sed -i '/^$/d' input.txt # for every line matching '^$' (empty line) apply 'd' (delete the line).
    grep -v '^$' # print every line not matching '^$' (empty line)


    awk 'NF' input.txt
    # 'NF' stand for Number of Fields (this is equivalent to number of columns
    # in a table). If the number of fields is 0 the line must be empty.  In awk
    # 0 is false and non-zero is true. Thus when 'NF' is non-zero (non-empty)
    # it is true, and the line will be printed.