# Reports:Tasks not implemented in PicoLisp

**Awareness**

If

**PicoLisp**is a language you like, or are interested in, please inform your fellow members of the PicoLisp community; this page can't be emptied without your and their participation.

## Contents

## Not implemented[edit]

These are currently not implemented in PicoLisp. Please implement some if you can. If any tasks are not possible or too complex in PicoLisp, they should not be on this list. To mark a task as such, add **{{omit from|PicoLisp}}**, preserving the capitalization of the language, to that task. It will appear below under the "Not Considered" section.

### A

### C

- Calculating the value of e
- Canny edge detector
- Catmull–Clark subdivision surface
- Chaos game
- Check Machin-like formulas
- Chinese zodiac
- Church Numerals
- Circles of given radius through two points
- Color quantization
- Combinations and permutations
- Commatizing numbers
- Compare sorting algorithms' performance
- Compiler/AST interpreter
- Compiler/code generator
- Compiler/lexical analyzer
- Compiler/syntax analyzer
- Compiler/virtual machine interpreter
- Conjugate transpose
- Continued fraction
- Continued fraction/Arithmetic/Construct from rational number
- Convert decimal number to rational
- Cramer's rule
- Currency
- Cut a rectangle

### D

### F

- Factorial base numbers indexing permutations of a collection
- Farey sequence
- Fibonacci word
- Fibonacci word/fractal
- Find largest left truncatable prime in a given base
- Find the intersection of two lines
- Fixed length records
- Flipping bits game
- Floyd-Warshall algorithm
- Four is magic
- Four is the number of letters in the ...
- Fractran

### H

### I

### K

### L

### M

### N

### P

- Paraffins
- Parallel Brute Force
- Partition an integer X into N primes
- Pathological floating point problems
- Peano curve
- Pentagram
- Percolation/Bond percolation
- Percolation/Mean cluster density
- Percolation/Mean run density
- Percolation/Site percolation
- Perfect totient numbers
- Permutations/Rank of a permutation
- Pig the dice game
- Pig the dice game/Player
- Plasma effect
- Polynomial regression
- Polyspiral
- Primes - allocate descendants to their ancestors
- Problem of Apollonius
- Pythagoras tree

### R

### S

- SOAP
- SQL-based authentication
- Safe primes and unsafe primes
- Sailors, coconuts and a monkey problem
- Scope/Function names and labels
- Sequence of primorial primes
- Set of real numbers
- Set puzzle
- Shoelace formula for polygonal area
- Shortest common supersequence
- Sierpinski pentagon
- Solve a Holy Knight's tour
- Solve a Hopido puzzle
- Solve a Numbrix puzzle
- Solve the no connection puzzle
- Spelling of ordinal numbers
- Spinning rod animation/Text
- Split a character string based on change of character
- Square-free integers
- Square but not cube
- Statistics/Normal distribution
- Strong and weak primes
- Suffixation of decimal numbers
- Sum and Product Puzzle
- Sum to 100
- Superellipse
- Superpermutation minimisation
- Sutherland-Hodgman polygon clipping

### T

### V

### Draft tasks without implementation[edit]

These tasks as drafts, meaning they largely need more work to turn them into full tasks. Perhaps you can help by trying to implement them in PicoLisp (after all, one of the key requirements for a task being non-draft is multiple implementations, preferably in widely different languages) but be aware that this may be difficult because of lack of definition of the task itself.

### 2

### A

### B

### C

- Cantor set
- Chaocipher
- Chebyshev coefficients
- Check input device is a terminal
- Check output device is a terminal
- Cheryl's Birthday
- Chess player/Move generation
- Chess player/Program options and user interface
- Chess player/Search and evaluation
- Code segment unload
- Color wheel
- Combinations with repetitions/Square Digit Chain
- Continued fraction/Arithmetic/G(matrix NG, Contined Fraction N)
- Continued fraction/Arithmetic/G(matrix NG, Contined Fraction N1, Contined Fraction N2)
- Convex hull
- Copy stdin to stdout
- Curve that touches three points
- Cycle detection

### D

### E

### F

- Faulhaber's formula
- Faulhaber's triangle
- Feigenbaum constant calculation
- Fibonacci heap
- File extension is in extensions list
- File size distribution
- Find URI in text
- Find duplicate files
- Find the intersection of a line with a plane
- Finite state machine
- Fivenum
- Free polyominoes enumeration
- French Republican calendar
- Functional coverage tree

### G

### H

### I

### M

### N

### O

### P

### R

- Railway circuit
- Ramsey's theorem
- Readline interface
- Recursive descent parser generator
- Reflection/List methods
- Reverse the gender of a string
- Robots
- Rosetta Code/List authors of task descriptions
- Rosetta Code/Rank languages by number of users
- Rosetta Code/Run examples
- Rosetta Code/Tasks sorted by average lines of code
- Rosetta Code/Tasks without examples

### S

- Self-hosting compiler
- Separate the house number from the street name
- Sexy primes
- Show Ascii table
- Simulated annealing
- Sine wave
- Singly-linked list/Element removal
- Snake
- Snake And Ladder
- Solve a Rubik's Cube
- Solving coin problems
- Sort numbers lexicographically
- Sorting Algorithms/Circle Sort
- Sorting algorithms/Cycle sort
- Sorting algorithms/Tree sort on a linked list
- Spoof game
- Starting a web browser
- Suffix tree
- Sunflower fractal

### T

### U

## Requiring Attention[edit]

### Examples[edit]

These tasks have implementations in PicoLisp, but somebody, somewhere, decided that the example implementation was faulty or in some other way requiring attention. If you're familiar with the task and language, please consider reviewing/correcting the example and removing the notice.

### M

### Other pages[edit]

These are other pages related to PicoLisp which require attention; with your knowledge and assistance, we can improve the quality of the site's content.

### No pages found.

## Not Considered[edit]

These tasks are not generally counted toward "unimplemented", as somebody, somewhere, decided that PicoLisp was inappropriate for these tasks, or implementations of them would be unenlightening. Feel free to try your hand at them anyway.

### C

### F

### M

### O

## End of List[edit]

Again, feel free to try your hand at any of the tasks listed on this page.