# 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

- ASCII art diagram converter
- AVL tree
- Abbreviations, automatic
- Abbreviations, easy
- Abbreviations, simple
- Abelian sandpile model
- Aliquot sequence classifications
- Angle difference between two bearings
- Angles (geometric), normalization and conversion
- Apply a digital filter (direct form II transposed)
- Approximate Equality
- Archimedean spiral
- Associative array/Merging
- Attractive numbers

### C

- Canny edge detector
- Cantor set
- Catmull–Clark subdivision surface
- Chaocipher
- Chaos game
- Check Machin-like formulas
- Chernick's Carmichael numbers
- 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/Arithmetic/Construct from rational number
- Convert decimal number to rational
- Convex hull
- Cramer's rule
- Cuban primes
- Cut a rectangle

### D

- De Bruijn sequences
- Death Star
- Deconvolution/2D+
- Deming's Funnel
- Department Numbers
- Determinant and permanent
- Determine if a string has all the same characters
- Determine if a string has all unique characters
- Determine if a string is collapsible
- Determine if a string is squeezable
- Digital root/Multiplicative digital root
- Draw a pixel
- Draw a rotating cube

### F

- Faces from a mesh
- Factorial base numbers indexing permutations of a collection
- Fairshare between two and more
- Farey sequence
- Fermat numbers
- Fibonacci word
- Fibonacci word/fractal
- File extension is in extensions list
- Find largest left truncatable prime in a given base
- Find the intersection of two lines
- First perfect square in base N with N unique digits
- First power of 2 that has leading decimal digits of 12
- Fixed length records
- Flipping bits game
- Floyd-Warshall algorithm
- Four is magic
- Four is the number of letters in the ...
- Fraction reduction
- Fractran
- Functional coverage tree
- Fusc sequence

### H

### I

### K

### L

### M

### N

### P

- P-value correction
- Palindromic gapful numbers
- Paraffins
- Parallel Brute Force
- Partition an integer X into N primes
- Pathological floating point problems
- Peaceful chess queen armies
- Peano curve
- Pell's equation
- Pentagram
- Percolation/Bond percolation
- Percolation/Mean cluster density
- Percolation/Mean run density
- Percolation/Site percolation
- Permutations/Rank of a permutation
- Pierpont primes
- 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

- RCRPG
- RPG Attributes Generator
- Ramanujan's constant
- Ramer-Douglas-Peucker line simplification
- Range consolidation
- Ranking methods
- Rare numbers
- Recaman's sequence
- Reflection/Get source
- Reflection/List methods
- Reflection/List properties
- Resistor mesh
- Retrieve and search chat history
- Rosetta Code/Find bare lang tags
- Runge-Kutta method

### S

- SOAP
- SQL-based authentication
- Safe primes and unsafe primes
- Sailors, coconuts and a monkey problem
- Scope/Function names and labels
- Sequence: nth number with exactly n divisors
- Sequence: smallest number greater than previous term with exactly n divisors
- Sequence: smallest number with exactly n divisors
- Sequence of primorial primes
- Set of real numbers
- Set puzzle
- Sexy primes
- Shoelace formula for polygonal area
- Shortest common supersequence
- Show Ascii table
- Sierpinski pentagon
- Smarandache prime-digital sequence
- Solve a Holy Knight's tour
- Solve a Hopido puzzle
- Solve a Numbrix puzzle
- Solve the no connection puzzle
- Spelling of ordinal numbers
- Square-free integers
- Square but not cube
- Statistics/Normal distribution
- Stirling numbers of the first kind
- Stirling numbers of the second kind
- Strong and weak primes
- Successive prime differences
- Suffixation of decimal numbers
- Sum and Product Puzzle
- Sum to 100
- Sunflower fractal
- Super-d numbers
- Superellipse
- Superpermutation minimisation
- Sutherland-Hodgman polygon clipping

### T

### V

### Draft tasks without implementation[edit]

These tasks are 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

- Chebyshev coefficients
- Check input device is a terminal
- Check output device is a terminal
- Checksumcolor
- Chemical Calculator
- 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
- Compiler/ Verifying Syntax
- Continued fraction/Arithmetic/G(matrix NG, Contined Fraction N)
- Continued fraction/Arithmetic/G(matrix NG, Contined Fraction N1, Contined Fraction N2)
- Curve that touches three points
- Cycle detection
- Cyclotomic Polynomial

### D

### E

### F

- Factorions
- Faulhaber's formula
- Faulhaber's triangle
- Feigenbaum constant calculation
- Fibonacci heap
- Fibonacci matrix-exponentiation
- 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

### G

### H

### I

### L

### M

### N

### P

### R

- Railway circuit
- Ramsey's theorem
- Random Latin Squares
- Raster bars
- Readline interface
- Recursive descent parser generator
- Resistance Calculator
- Resistance Network Calculator
- 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

- Safe mode
- Self-hosting compiler
- Separate the house number from the street name
- Simulated annealing
- Sine wave
- Singly-linked list/Element removal
- Snake
- Snake And Ladder
- Solve a Rubik's Cube
- Solving coin problems
- Sorting Algorithms/Circle Sort
- Sorting algorithms/Cycle sort
- Sorting algorithms/Tree sort on a linked list
- Spoof game
- Starting a web browser
- Suffix tree
- Sum data type

### 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.

### No pages found.

### 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.