saltvedt
Joined 13 years ago
Karma
248
Submissions
68
Member since
Jul 17
Recent submissions
Comment · 1 year ago
Norsk Tipping has recently gotten fines (46MNok and 36MNok) from the gaming authorities for other issues:
https://www.vg.no/sport/i/KMAxP4/varsler-gigantbot-til-norsk...
https://www.nrk.no/innlandet/norsk-tipping-far-bot-pa-36-mil...
Comment · 7 years ago
Comment · 7 years ago
I'm solving a very related problem with https://cited.news/
It's a news aggregator based on Wikipedia references.
Comment · 7 years ago
I've created a news aggregator based on Wikipedia references. While this might be comparing apples to oranges, here's the list of the most cited websites by Wikipedia:
https://cited.news/domains
It's still a bit buggy, so the "blank" domain is ranked #1, followed by NY Times, BBC and The Guardian.
Fox News is ranked at #93 at that list: https://cited.news/domains/show/www.foxnews.com/citations
Comment · 7 years ago
I tried adding it: https://en.wikipedia.org/w/index.php?title=Facebook&type=rev...
The article is dated on 14. of March though, so it should not appear on the front page but here: https://cited.news/wikipedia_pages/date/2019-03-14
Comment · 7 years ago
My project, the news aggregater Cited News (https://cited.news/), uses Wikipedia references as source for news.
Comment · 7 years ago
There is a very similar case going on in Norway, where Håkon Wium Lie (creator of CSS) is being sued: https://www.wiumlie.no/2018/rettspraksis/06-11-blog.html
Comment · 7 years ago
"The Bailey–Borwein–Plouffe formula (BBP formula) is a spigot algorithm for computing the nth binary digit of the mathematical constant π using base-16 representation. The formula can directly calculate the value of any given digit of π without calculating the preceding digits. (...) Though the BBP formula can directly calculate the value of any given digit of π with less computational effort than formulas that must calculate all intervening digits, BBP remains linearithmic (O(n log n)), whereby successively larger values of n require increasingly more time to calculate; that is, the "further out" a digit is, the longer it takes BBP to calculate it, just like the standard π-computing algorithms."
https://en.wikipedia.org/wiki/Bailey%E2%80%93Borwein%E2%80%9...
Comment · 8 years ago
The Norwegian equivalent of this project, got sued for copyright infringement of supreme court verdicts: http://www.wiumlie.no/2018/rettspraksis/10-22-returns
Comment · 8 years ago
JRuby (Ruby on JVM) and Warbler[0] solves this problem quite nicely, even though you end up with JARs instead of true binaries. (There are tools for packaging JARs as binaries, if you really want that.)
Comment · 8 years ago
def anagram?(a,b)
a.reverse == b
end
Comment · 8 years ago
Not that I've actually read the book myself, but Being and Time by Heidegger seems to fit your description.
Reading it will feel like running into a brick wall, so I suggest reading about Heidegger for context first: https://plato.stanford.edu/entries/heidegger/
Reading the article above might still feel like running into a wall though (perhaps one of wood, this time). You might want to have a listen to an episode on Heidegger by Philosophize This!: http://philosophizethis.org/episode-100-transcript/
Current project: http://servicemonitor.io Blog: http://saltvedt.net