# Reports:Tasks not implemented in Mathematica

**Awareness**

If

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

## Contents

## Not implemented[edit]

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

### 2

### C

### D

### F

### K

### M

### O

### P

- Parametric polymorphism
- Parse an IP Address
- Parsing/RPN to infix conversion
- Password generator
- Pathological floating point problems
- Pattern matching
- Penney's game
- Percolation/Bond percolation
- Percolation/Mean cluster density
- Percolation/Site percolation
- Perfect shuffle
- Pig the dice game/Player
- Pinstripe/Printer
- Plasma effect
- Primes - allocate descendants to their ancestors
- Pythagoras tree

### R

### S

- S-Expressions
- Sailors, coconuts and a monkey problem
- Same Fringe
- Scope/Function names and labels
- Search a list of records
- Sequence of primes by Trial Division
- Sierpinski pentagon
- Simple database
- Simulate input/Keyboard
- Simulate input/Mouse
- Sokoban
- Solve a Hidato puzzle
- Solve a Holy Knight's tour
- Solve a Hopido puzzle
- Solve a Numbrix puzzle
- Stable marriage problem
- Stern-Brocot sequence
- Stream Merge
- Subleq
- Sum and Product Puzzle
- Sutherland-Hodgman polygon clipping
- Synchronous concurrency

### T

### U

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

### A

### C

- Card shuffles
- Chebyshev coefficients
- Check input device is a terminal
- Check output device is a terminal
- Chess player
- Chess player/Move generation
- Chess player/Program options and user interface
- Chess player/Search and evaluation
- Cipolla's algorithm
- Color wheel
- Combinations with repetitions/Square Digit Chain
- Commatizing numbers
- Compiler/lexical analyzer
- Compiler/syntax analyzer
- Continued fraction/Arithmetic/G(matrix NG, Contined Fraction N)
- Continued fraction/Arithmetic/G(matrix NG, Contined Fraction N1, Contined Fraction N2)
- Convex hull
- Currency
- Cycle detection

### E

### F

### G

### I

### M

### O

### P

### R

- Railway circuit
- Read a file character by character/UTF8
- Readline interface
- Recursive descent parser generator
- Reflection/List methods
- Remote agent/Agent interface
- Remote agent/Agent logic
- Remote agent/Simulation
- Reverse the gender of a string
- Robots
- Rosetta Code/List authors of task descriptions
- Rosetta Code/Run examples
- Rosetta Code/Tasks sorted by average lines of code
- Run as a daemon or service

### S

- Sattolo cycle
- Selective File Copy
- Self-hosting compiler
- Separate the house number from the street name
- Sequence of primorial primes
- Shortest common supersequence
- Simulated annealing
- Smith numbers
- Snake
- Solving coin problems
- Sort a list of object identifiers
- Sorting Algorithms/Circle Sort
- Sorting algorithms/Cycle sort
- Sorting algorithms/Patience sort
- Sorting algorithms/Tree sort on a linked list
- Starting a web browser
- Straddling checkerboard
- Substitution Cipher
- Suffix tree
- Superpermutation minimisation

### T

- Tamagotchi emulator
- Tasks without examples
- Taxicab numbers
- Terminal control/Restricted width positional input/No wrapping
- Terminal control/Restricted width positional input/With wrapping
- Tetris
- Text to HTML
- Time-based One-time Password Algorithm
- Tonelli-Shanks algorithm
- Topological sort/Extracted top item
- Transportation problem
- Type detection

### U

## Requiring Attention[edit]

### Examples[edit]

These tasks have implementations in Mathematica, 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.

### Other pages[edit]

These are other pages related to Mathematica 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 Mathematica was inappropriate for these tasks, or implementations of them would be unenlightening. Feel free to try your hand at them anyway.

### C

## End of List[edit]

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