Open thread, July 10 - July 16, 2017

If it's worth saying, but not worth its own post, then it goes here.

Notes for future OT posters:

1. Please add the 'open_thread' tag.

2. Check if there is an active Open Thread before posting a new one. (Immediately before; refresh the list-of-threads page before posting.)

3. Open Threads should start on Monday, and end on Sunday.

4. Unflag the two options "Notify me of new top level comments on this article" and "

39 comments, sorted by
magical algorithm
Highlighting new comments since Today at 5:36 PM
Select new highlight date

I’d like to ask LW for feedback on names for my upcoming todo list app.

In summary, I spent the last 2 years developing a todo app to replace Wunderlist because I’ve always been unsatisfied with it. I mentioned the app on LW earlier. Microsoft recently announced that they plan to shut down Wunderlist, which is a one-in-a-lifetime marketing opportunity, so I’m currently in scramble mode preparing everything (site, app, company) for the closure event.

The central idea of the app is that it helps you keep your todo list focused on what you can do right now, at this very moment (the approach is similar to Mark Forster’s Autofocus system and is heavily based on the concept of mental ‘ripeness’ of the task to be done).

So here’s my shortlist of names (all with .com domains I already own):

  • Matterlist
  • LumenList
  • PragmaPad
  • PragmaPlanner
  • Persisto

Which name do you like the most? Which ones sound bad to you?

When giving feedback, consider Paul Graham’s advice on naming: “It turns out almost any word or word pair that is not an obviously bad name is a sufficiently good one.” So if any of the names jumps at you as ‘obviously bad’, please let me know.

'Persisto' is a supervillain in the guise of a window cleaner. I think.

Running the names through native speakers definitely was a good idea :D

I am a Ukrainian-born Russian-ethnic Ukrainian citizen :D

You should add a "None of the above" option. If I saw an app with these names, I'd be hard pressed to give it a chance.

You might want to try https://www.namingforce.com ; crowd sourced names; pay the winner $100.

Tell this to Vladimir_Golovin. I have just installed the poll, exactly for the names he proposed.

I think, the option "none of the above" is useless. Imagine some future parents have a list of potential names for their offspring. Mary, Magdalene, Judith and Margarete. They show you this list and ask you which name would you choose.

Would you still demand "none of the above" option? (Applications are somewhat like children.)

I think, the option "none of the above" is useless.

Au contraire, I think it's quite useful and means exactly what it says: "I don't like any of the options offered".

In the case of children names, yes, if none of the proposed names are to my liking, I would find a polite way to say "None of the above"

Thomas, thank you for setting up the poll! Somehow this didn't occur to me.

Because I think it would be useful to be able to weigh in explicitly on each option rather than just pick a favorite:

Matterlist[pollid:1202]

LumenList[pollid:1203]

PragmaPad[pollid:1204]

PragmaPlanner[pollid:1205]

Persisto[pollid:1206]

They all seem very long to me. Why not Xlist for some one syllable word X?

There's no chance that I will be able to secure xlist.com or anything similar for a reasonable sum of money (i.e. under $3000 or so).

Edit: oh, sorry, I completely misread you (was in a hurry). I did a search on http://www.naminum.com/prepend?q=list, and there were one-syllable words among the results, but none of them jumped at me as a good name (in addition to the vast majority of them being already taken).

Does it make more sense to sign up for cryonics at Alcor or the Cryonics Institute?

If you can afford it, it makes more sense to sign up at Alcor. Alcor's patient care trust improves the chances that you will be cared for indefinitely after cryopreservation. CI asserts their all volunteer status as a benefit, but the cryonics community has not been growing and has been aging. It is not unlikely that there could be problems with availability of volunteers in the next 50 years.

I found a user named chron whose posts are all banned for no apparently reason. (If you use this link you can see their comments, but while looking at a post or comment they replied to, chron's comment will show as "deleted".) This user also shows up in the list of banned users. But there seems to be nothing wrong with this user's posts/comments that I can see. I tried searching for a comment explaining why this user was banned but couldn't find one. Is there a place that records the reason why each banned user was banned? If so, could someone please link it to the wiki page about moderation?

Most of the people who are banned on LW are banned because they are Eugine's clones.

Chron was Eugine. Permanently banned for vote manipulation

chron sounds like one of Eugine Nier's alter egos.

Eliezer wrote this article a few years ago, about the 2 things that rationalists need faith to believe. Has any progress been made in finding justifications for either of these things that do not require faith?

This is probably a known issue, and I know a rewritten version of the Less Wrong software is being worked on, but I just noticed that even if I'm using HTTPS, comment permalinks (the chain icon at the bottom of a comment) are HTTP URLs.

What other non-rat communities are you a part of ?

419eater.

P.S. "rat" is a terrible label, I would even prefer "cult"

What, a murine community is not good enough? X-)

Yes but sadly there isn't a rar adjent community for everything, maybe in the form of rat fiction but still I kinda want to know what other people here visit because I'm interested.

An upper bound is 27 queens, which can threaten all squares of a 3D chessboard hyperplane (and the two adjacent ones), which sweeps through the hypercube and smashes the king against a hyperwall. This assumes that the game doesn't draw after 50 turns.

50 moves rule is totally inappropriate in 4D. Let us dismiss that rule here, yes.

An upper bound is 17 queens: 16 threaten all 6^4 inner squares, then the 17th moves to the inner square closest to the king.

Edit: Nevermind, this amounts to the 17th queen checkmating the king on a 3D board with warp sides.

I'm unlikely to try to solve it, but are you looking for an answer like "if the king starts here, you can do it with N queens placed at...", or "no matter where the pieces start, you can do it with N queens"? Are you limiting positions to those which could theoretically be achieved in a legal game of 4D chess?

(By that last one, I mean that on a 2D board, you could have a king in the corner and a queen directly adjacent above and beside it, and that would be mate. But you can't ever have that position in a legal chess game. If something like that turns out to be the optimal, would you accept it?)

I mean that on a 2D board, you could have a king in the corner and a queen directly adjacent above and beside it, and that would be mate.

No, unless the queen is defended by some other piece, otherwise the king could just capture it. Or am I missing something?

Ah, I was unclear: I meant two queens, one each above and beside.

It's the worst case scenario for queens, of course. Just as you ask how to mate the solitary black king with the white king and a white rook in 2D chess. The mating method should always work.

If it doesn't always work, which means that there is a position from where the mate isn't possible ... then that number of queens isn't the answer we are looking for.

To answer the other question: there exists a checkmate with two queens. Just pin the king into a corner with one, and guard that queen with another.

But can you actually pin a noncooperative king there with only 2 queens? You can in 2D, but hardly in 3D and even less in 4D.

Legal moves are analogous to those of 2D chess.

Just to be sure, does it mean that a king can move by a non-zero vector (a, b, c, d) where a, b, c, d in {-1, 0, 1}, and a queen can move by a non-zero vector (a, b, c, d) where a, b, c, d in {-n, 0, n} for some n?