How to Implement Deutsch’s Algorithm in Haskell
The fist column contains input values and the first row contains output values. The cells contain the functions returning some value at some argument. That is, functions f1 and f3 return 0 if the input value is 0. Since each cell of the table has two functions, it's impossible to solve the Deutsch's problem in one call in classical model of computations. The model of quantum computing is another s
2048 in Erlang
This article is about a WebSocket server on Erlang rather than about the game itself. I’ll tell you a small prehistory. When I began playing 2048 I couldn’t stop. It was to the detriment of both my job and family. So I decided that a bot should play instead of me. But the problem was that it’s a user game, there’s no global rating and it’s not comfortable to play without a browser. That’s why I de
J Can be Readable
You must be kidding me! It’s like programming using regular expressions… You’ll never make me do that again! I’m looking at the code and feel like an idiot. Isn’t it really an esoteric language like brain fuck? Does anyone really use it? And such programs can be read afterwards? quicksort=: (($:@(<#[), (=#[), $:@(>#[)) ({~ ?@#)) ^: (1<#) Perl is a trifle against it. About J language J — is a Korea
N2O: Erlang Web Framework
Introduction This post implies a good intro into N2O. In order to learn about Erlang/OTP Web Framework N2O main features you should visit the github page or the official SynRC website. You will find there all the charts and presentations which you like so much. In this article I will cover the principles of framework operation. Version under consideration: N2O: 1.1.0. It’s always more interesting
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
Introduction to J Programming Language [2004]
Lock-Free Data Structures. Exploring Queues
Lock-Free Data Structures. Yet Another Treatise
Lock-Free Data Structures. The Evolution of a Stack
Automatic Algorithms Optimization via Fast Matrix Exponentiation
A Few Words About Reversible Computing
Building a Minimal Convex Hull
Radix Trees
Reactive Actors in Java
Randomized Binary Search Trees
Cellular Automata Using Comonads
Lock-free Data Structures. The Inside. Memory Management Schemes
Haskell. Testing a Multithread Application
https://kukuruku.co/hub/cpp/interpreting-when-compiling-or-an-alternative-understanding-of-lambdas-in-c-11
Lock-free Data Structures. Memory Model. Part 3.
Transactional Memory: History and Development
