Anonymous user
Rosetta Code:Village Pump/Suggest a programming task: Difference between revisions
Rosetta Code:Village Pump/Suggest a programming task (view source)
Revision as of 13:16, 13 December 2014
, 9 years ago→Unsorted: ===
(Simple OCR) |
m (→Unsorted: ===) |
||
Line 332:
Place new items here, if it's unclear where they belong.
=== Simple OCR ===
for example comics (like Dilbert), or screenshots. <br>
WRT "simple", we restrict this to chars of known fonts,
e.g. by giving the program some picture(s) with known text-samples. --13:07, 13 December 2014 (UTC)
A bot for splitting pages into sub-pages.
If possible, with only a single captcha-check.<br>
Line 345 ⟶ 346:
The Page-splitter should be able to automate such tasks. --[[User:Hajo|Hajo]] ([[User talk:Hajo|talk]]) 07:20, 21 November 2014 (UTC)
=== Reverisible random bit generator ===
* Implement a random bit generator that can be run forward and backward. When run backward it produces bits in reverse order. I suggest using a maximal period minimal cost linear hybrid cellular automaton utilizing rules 90 and 150. -[[User:Zelah|Zelah]] ([[User talk:Zelah|talk]]) 02:35, 7 May 2014 (UTC)▼
Implement a random bit generator that can be run forward and backward.
▲
=== Duff's Device ===
===Bank Routing Number Validator===
Try it for 121000248 - it should sum up to 60. Also try it on the 9-digit routing number found at the bottom of your checking account)
Display the clipboard content & Write new content to the clipboard
===Minilight===
===Random RC task===
**Possibly done as a variation on [[Rosetta Code/Find unimplemented tasks]]?
:See [http://irclog.perlgeek.de/rosettacode/2011-11-21#i_4737091 this IRC discussion] for more information -- [[User:Eriksiers|Erik Siers]] 05:46, 21 November 2011 (UTC)
=== Noises ===
* Perlin Noise, Simplex Noise, Worley Noise implementations
http://en.wikipedia.org/wiki/Perlin_noise
Line 368 ⟶ 378:
* Perlin Noise, Simplex Noise, Worley Noise implementations for tiling system in video games or other media
Using mutexes or semaphores to conduct thread safe and robust read and writes from a circular buffer.
===Henderson Escher Picture Language===
===Phonecode===
: Thanks so much for that link! I had read the paper some time ago but I probably have the link on an old hard drive somewhere...
: You have to remember though, that the aims of RC are ''very'' different to the authors of that paper and any task would have to be written for RC. If anyone has the number to a cold-calling firm, we could find the most appropriate phrase for their number ;-) or maybe not. --[[User:Paddy3118|Paddy3118]] 08:15, 7 May 2011 (UTC)
:: Here's an easy one. The phone number to the White House [http://www.whitehouse.gov/contact switch board]: 202-456-1414. Nothing specific or political intended here; it's just a published, public number. I do like the task idea, though. --[[User:Short Circuit|Michael Mol]] 13:15, 8 May 2011 (UTC)
* I suggest implementations of various maze generation algorithms, such as Recursive Division or Prim's Algorithm. A website that already does this for Python can be found here: [http://weblog.jamisbuck.org/search?q=maze+generation http://weblog.jamisbuck.org]--[[User:Intercoder|Intercoder]] 12:57, 7 March 2011 (UTC)
|