Explore >> Select a destination
|
You are here 
|
mishadoff.com | ||
| | | | |
jiggerwit.wordpress.com
|
|
| | | | | I received an email from Josef Urban this morning. His group has been using AI to find algorithms that generate the sequences found in the Sloane's Online Encyclopedia of Integer Sequences (OEIS). The input is a finite sequence of integers. The output is an algorithm that produces the same sequence of digits. Using AI, they... | |
| | | | |
arnorhs.dev
|
|
| | | | | I read somewhere that a bitwise left shift was a faster method of removing a fraction of a floating point number in Javascript than using parseInt or Math.floor(). I wasn't surprised that parseInt was slow, since I think it parses the number as a string, but the left shift being faster than Math.floor() was a bit more puzzling to me. So I decided to make a JSPerf test to compare those three methods. Read on for the full results | |
| | | | |
www.jeremykun.com
|
|
| | | | | Numberphile posted a video today describing a neat trick based on complete sequences: The mathematics here is pretty simple, but I noticed at the end of the video that Dr. Grime was constructing the cards by hand, when really this is a job for a computer program. I thought it would be a nice warmup exercise (and a treat to all of the Numberphile viewers) to write a program to construct the cards for any complete sequence. | |
| | | | |
japanesenostalgiccar.com
|
|
| | | Japanese Nostalgic Car | ||
