Reports:Tasks not implemented in Oforth
If Oforth is a language you like, or are interested in, please inform your fellow members of the Oforth community; this page can't be emptied without your and their participation.
Contents
Not implemented[edit]
These are currently not implemented in Oforth. Please implement some if you can. If any tasks are not possible or too complex in Oforth, they should not be on this list. To mark a task as such, add {{omit from|Oforth}}, 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
- Abelian sandpile model/Identity
- Abundant odd numbers
- Achilles numbers
- Active Directory/Connect
- Active Directory/Search for a user
- Active object
- Add a variable to a class instance at runtime
- Additive primes
- Algebraic data types
- Almkvist-Giullera formula for pi
- Amb
- Anagrams/Deranged anagrams
- Angle difference between two bearings
- Angles (geometric), normalization and conversion
- Animate a pendulum
- Animation
- Anonymous recursion
- Anti-primes
- Append a record to the end of a text file
- Apply a digital filter (direct form II transposed)
- Approximate equality
- Archimedean spiral
- Arithmetic-geometric mean/Calculate Pi
- Arithmetic/Rational
- Arithmetic evaluation
- Arithmetic numbers
- Ascending primes
- Associative array/Creation
- Associative array/Iteration
- Associative array/Merging
- Atomic updates
- Attractive numbers
- Average loop length
- Averages/Mean angle
- Averages/Mean time of day
- Averages/Median
- Averages/Mode
B
- Babbage problem
- Balanced ternary
- Barnsley fern
- Base64 decode data
- Bell numbers
- Benford's law
- Bernoulli numbers
- Best shuffle
- Bin given limits
- Binary search
- Binary strings
- Bioinformatics/Sequence mutation
- Bioinformatics/base count
- Biorhythms
- Bitcoin/address validation
- Bitcoin/public point to address
- Bitmap
- Bitmap/Bresenham's line algorithm
- Bitmap/Bézier curves/Cubic
- Bitmap/Bézier curves/Quadratic
- Bitmap/Flood fill
- Bitmap/Histogram
- Bitmap/Midpoint circle algorithm
- Bitmap/PPM conversion through a pipe
- Bitmap/Read a PPM file
- Bitmap/Read an image through a pipe
- Bitmap/Write a PPM file
- Bitwise IO
- Box the compass
- Brace expansion
- Brazilian numbers
- Brilliant numbers
- Brownian tree
- Bulls and cows/Player
- Burrows–Wheeler transform
C
- CRC-32
- CSV data manipulation
- CSV to HTML translation
- CUSIP
- Calculating the value of e
- Calendar
- Calendar - for "REAL" programmers
- Calkin-Wilf sequence
- Call a foreign-language function
- Call a function in a shared library
- Canny edge detector
- Canonicalize CIDR
- Cantor set
- Carmichael 3 strong pseudoprimes
- Cartesian product of two or more lists
- Casting out nines
- Catmull–Clark subdivision surface
- Chaocipher
- Chaos game
- Chat server
- Check Machin-like formulas
- Check input device is a terminal
- Check output device is a terminal
- Check that file exists
- Chernick's Carmichael numbers
- Cheryl's birthday
- Chinese remainder theorem
- Chinese zodiac
- Cholesky decomposition
- Chowla numbers
- Church numerals
- Circular primes
- Cistercian numerals
- Closest-pair problem
- Color of a screen pixel
- Color quantization
- Color wheel
- Colorful numbers
- Colour bars/Display
- Colour pinstripe/Display
- Colour pinstripe/Printer
- Combinations
- Combinations and permutations
- Combinations with repetitions
- Commatizing numbers
- Compare length of two strings
- Compare sorting algorithms' performance
- Compiler/AST interpreter
- Compiler/code generator
- Compiler/lexical analyzer
- Compiler/syntax analyzer
- Compiler/virtual machine interpreter
- Composite numbers k with no single digit factors whose factors are all substrings of k
- Conjugate transpose
- Consecutive primes with ascending or descending differences
- Constrained genericity
- Constrained random points on a circle
- Continued fraction
- Continued fraction/Arithmetic/Construct from rational number
- Convert decimal number to rational
- Convert seconds to compound duration
- Convex hull
- Conway's Game of Life
- Copy stdin to stdout
- Count in factors
- Count in octal
- Count the coins
- Cramer's rule
- Create a file
- Create a file on magnetic tape
- Create a two-dimensional array at runtime
- Create an HTML table
- Create an object at a given address
- Cuban primes
- Cullen and Woodall numbers
- Currency
- Curzon numbers
- Cut a rectangle
- Cyclops numbers
- Cyclotomic polynomial
D
- DNS query
- Damm algorithm
- Date format
- Date manipulation
- De Bruijn sequences
- Deal cards for FreeCell
- Death Star
- Deceptive numbers
- Deconvolution/1D
- Deconvolution/2D+
- Deepcopy
- Define a primitive data type
- Delete a file
- Deming's Funnel
- Department numbers
- Descending primes
- 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 numeric
- Determine if a string is squeezable
- Determine if only one instance is running
- Determine if two triangles overlap
- Determine sentence type
- Dice game probabilities
- Digital root/Multiplicative digital root
- Dijkstra's algorithm
- Dinesman's multiple-dwelling problem
- Dining philosophers
- Disarium numbers
- Discordian date
- Display a linear combination
- Display an outline as a nested table
- Distributed programming
- Diversity prediction theorem
- Documentation
- Dragon curve
- Draw a clock
- Draw a cuboid
- Draw a pixel
- Draw a rotating cube
- Draw a sphere
- Duffinian numbers
- Dutch national flag problem
E
- EKG sequence convergence
- Earliest difference between prime gaps
- Eban numbers
- Echo server
- Eertree
- Egyptian division
- Egyptian fractions
- Element-wise operations
- Elementary cellular automaton
- Elementary cellular automaton/Infinite length
- Elementary cellular automaton/Random Number Generator
- Elliptic Curve Digital Signature Algorithm
- Elliptic curve arithmetic
- Empty directory
- Entropy/Narcissist
- Equal prime and composite sums
- Erdös-Selfridge categorization of primes
- Esthetic numbers
- Euler's constant 0.5772...
- Euler's identity
- Executable library
- Execute Brain****
- Execute Computer/Zero
- Execute HQ9+
- Execute SNUSP
- Execute a Markov algorithm
- Exponentiation order
- Exponentiation with infix operators in (or operating on) the base
- Extend your language
- Extensible prime generator
F
- FASTA format
- FTP
- Faces from a mesh
- Factorial base numbers indexing permutations of a collection
- Factorions
- Factors of a Mersenne number
- Fairshare between two and more
- Farey sequence
- Fast Fourier transform
- Faulhaber's formula
- Faulhaber's triangle
- Feigenbaum constant calculation
- Fermat numbers
- Fibonacci n-step number sequences
- Fibonacci word/fractal
- File extension is in extensions list
- File size distribution
- Find Chess960 starting position identifier
- Find common directory path
- Find duplicate files
- Find if a point is within a triangle
- Find largest left truncatable prime in a given base
- Find palindromic numbers in both binary and ternary bases
- Find the intersection of a line with a plane
- Find the intersection of two lines
- Find the missing permutation
- First class environments
- First perfect square in base n with n unique digits
- First power of 2 that has leading decimal digits of 12
- Fivenum
- Fixed length records
- Flipping bits game
- Floyd's triangle
- Floyd-Warshall algorithm
- Forest fire
- Fork
- Formal power series
- Formatted numeric output
- Fortunate numbers
- Four bit adder
- Four is magic
- Four is the number of letters in the ...
- Fractal tree
- Fraction reduction
- Fractran
- French Republican calendar
- Function frequency
- Functional coverage tree
- Fusc sequence
G
- GUI/Maximum window dimensions
- GUI component interaction
- GUI enabling/disabling of controls
- Galton box animation
- Gapful numbers
- Gauss-Jordan matrix inversion
- Gaussian elimination
- General FizzBuzz
- Generate Chess960 starting position
- Generate random chess position
- Generator/Exponential
- Get system command output
- Globally replace text in several files
- Go Fish
- Goldbach's comet
- Graph colouring
- Gray code
- Grayscale image
- Greatest subsequential sum
- Greyscale bars/Display
- Guess the number/With feedback (player)
H
- HTTP
- HTTPS
- HTTPS/Authenticated
- HTTPS/Client-authenticated
- Halt and catch fire
- Hamming numbers
- Handle a signal
- Harmonic series
- Hash from two arrays
- Hash join
- Hello world/Graphical
- Hello world/Web server
- Here document
- Heronian triangles
- Hickerson series of almost integers
- Hilbert curve
- History variables
- Holidays related to Easter
- Home primes
- Honeycombs
- Horizontal sundial calculations
- Horner's rule for polynomial evaluation
- Host introspection
- Hostname
- Hough transform
- Huffman coding
- Humble numbers
- Hunt the Wumpus
I
- IBAN
- ISBN13 check digit
- I before E except after C
- Identity matrix
- Idiomatically determine all the characters that can be used for symbols
- Idiomatically determine all the lowercase and uppercase letters
- Image convolution
- Image noise
- Imaginary base numbers
- Increasing gaps between consecutive Niven numbers
- Index finite lists of positive integers
- Intersecting number wheels
- Inverted index
- Isqrt (integer square root) of X
J
K
- K-d tree
- K-means++ clustering
- Kaprekar numbers
- Kernighans large earthquake problem
- Keyboard macros
- Knapsack problem/0-1
- Knapsack problem/Bounded
- Knapsack problem/Unbounded
- Knight's tour
- Knuth's algorithm S
- Knuth's power tree
- Koch curve
- Kolakoski sequence
- Kosaraju
- Kronecker product
- Kronecker product based fractals
L
- LU decomposition
- LZW compression
- Lah numbers
- Langton's ant
- Largest number divisible by its digits
- Largest proper divisor of n
- Last letter-first letter
- Latin Squares in reduced form
- Latin Squares in reduced form/Randomizing using Jacobson and Matthews’ Technique
- Law of cosines - triples
- Legendre prime counting function
- Leonardo numbers
- Letter frequency
- Levenshtein distance
- Levenshtein distance/Alignment
- List comprehensions
- List rooted trees
- Long literals, with continuations
- Long primes
- Long year
- Longest common subsequence
- Longest common substring
- Longest increasing subsequence
- Longest string challenge
- Loops/Increment loop index within loop body
- Loops/Nested
- Loops/With multiple ranges
- Loops/Wrong ranges
- Lucas-Lehmer test
- Lucky and even lucky numbers
- Lychrel numbers
M
- MAC Vendor Lookup
- MD4
- MD5
- MD5/Implementation
- Machine code
- Magic 8-ball
- Magic constant
- Magic squares of doubly even order
- Magic squares of singly even order
- Magnanimous numbers
- Main step of GOST 28147-89
- Make directory path
- Man or boy test
- Mandelbrot set
- Mastermind
- Matrix-exponentiation operator
- Matrix chain multiplication
- Matrix digital rain
- Matrix multiplication
- Matrix transposition
- Maximum triangle path sum
- Mayan calendar
- Mayan numerals
- Maze generation
- Maze solving
- McNuggets problem
- Median filter
- Memory layout of a data structure
- Menu
- Merge and aggregate datasets
- Mertens function
- Metallic ratios
- Metaprogramming
- Metronome
- Mian-Chowla sequence
- Miller–Rabin primality test
- Mind boggling card trick
- Minesweeper game
- Minimal steps down to 1
- Minimum multiple of m where digital sum equals m
- Minimum positive multiple in base 10 using only 0 and 1
- Minkowski question-mark function
- Modified random distribution
- Modular arithmetic
- Monads/List monad
- Monads/Maybe monad
- Monads/Writer monad
- Monte Carlo methods
- Monty Hall problem
- Morse code
- Motzkin numbers
- Mouse position
- Move-to-front algorithm
- Multi-base primes
- Multi-dimensional array
- Multiple regression
- Multiplication tables
- Multiplicative order
- Multisplit
- Munchausen numbers
- Munching squares
- Musical scale
- Möbius function
N
- N-queens problem
- N-smooth numbers
- Named parameters
- Narcissist
- Natural sorting
- Nautical bell
- Negative base numbers
- Nested function
- Nested templated data
- Next highest int from digits
- Nim game
- Non-continuous subsequences
- Non-decimal radices/Convert
- Non-decimal radices/Input
- Non-decimal radices/Output
- Non-transitive dice
- Nonoblock
- Nonogram solver
- Number names
- Numbers which are not the sum of distinct squares
- Numbers with equal rises and falls
- Numeric error propagation
- Numerical and alphabetical suffixes
- Numerical integration
- Numerical integration/Gauss-Legendre Quadrature
O
P
- P-Adic numbers, basic
- P-Adic square roots
- P-value correction
- Padovan n-step number sequences
- Padovan sequence
- Palindrome dates
- Palindromic gapful numbers
- Pancake numbers
- Pangram checker
- Paraffins
- Parallel brute force
- Parameterized SQL statement
- Parse an IP Address
- Parsing/RPN to infix conversion
- Parsing/Shunting-yard algorithm
- Particle fountain
- Partition an integer x into n primes
- Partition function P
- Pascal's triangle/Puzzle
- Pascal matrix generation
- Password generator
- Pathological floating point problems
- Peaceful chess queen armies
- Peano curve
- Pell's equation
- Pell numbers
- Penney's game
- Pentagram
- Pentomino tiling
- Percentage difference between images
- Percolation/Bond percolation
- Percolation/Mean cluster density
- Percolation/Mean run density
- Percolation/Site percolation
- Perfect totient numbers
- Periodic table
- Peripheral drift illusion
- Perlin noise
- Permutation test
- Permutations
- Permutations/Derangements
- Permutations/Rank of a permutation
- Permutations by swapping
- Pernicious numbers
- Pierpont primes
- Pig the dice game
- Pig the dice game/Player
- Pinstripe/Display
- Pinstripe/Printer
- Pisano period
- Plasma effect
- Play recorded sounds
- Playfair cipher
- Playing cards
- Plot coordinate pairs
- Poker hand analyser
- Polymorphic copy
- Polynomial long division
- Polynomial regression
- Polyspiral
- Power set
- Pragmatic directives
- Primality by Wilson's theorem
- Prime conspiracy
- Prime triangle
- Primes - allocate descendants to their ancestors
- Primorial numbers
- Priority queue
- Probabilistic choice
- Problem of Apollonius
- Program name
- Pseudo-random numbers/Combined recursive generator MRG32k3a
- Pseudo-random numbers/Middle-square method
- Pseudo-random numbers/PCG32
- Pseudo-random numbers/Splitmix64
- Pseudo-random numbers/Xorshift star
- Pythagoras tree
- Pythagorean quadruples
- Pythagorean triples
R
- RCRPG
- RIPEMD-160
- RPG attributes generator
- RSA code
- Ramanujan's constant
- Ramanujan primes/twins
- Ramer-Douglas-Peucker line simplification
- Random Latin squares
- Random number generator (device)
- Random number generator (included)
- Random numbers
- Random sentence from book
- Range consolidation
- Range extraction
- Ranking methods
- Rare numbers
- Rate counter
- Ray-casting algorithm
- Read a configuration file
- Read a file character by character/UTF8
- Read a specific line from a file
- Read entire file
- Recaman's sequence
- Record sound
- Reduced row echelon form
- Reflection/Get source
- Reflection/List methods
- Reflection/List properties
- Regular expressions
- Rename a file
- Rendezvous
- Repunit primes
- Resistor mesh
- Retrieve and search chat history
- Rhonda numbers
- Rock-paper-scissors
- Roman numerals/Decode
- Roots of a quadratic function
- Roots of unity
- Rosetta Code/Count examples
- Rosetta Code/Find bare lang tags
- Rosetta Code/Find unimplemented tasks
- Rosetta Code/Fix code tags
- Rosetta Code/Rank languages by number of users
- Rosetta Code/Rank languages by popularity
- Runge-Kutta method
- Runtime evaluation/In an environment
- Ruth-Aaron numbers
S
- S-expressions
- SHA-1
- SHA-256
- SHA-256 Merkle tree
- SOAP
- SQL-based authentication
- Safe addition
- Safe primes and unsafe primes
- Sailors, coconuts and a monkey problem
- Same fringe
- Scope modifiers
- Search a list of records
- Search in paragraph's text
- Secure temporary file
- Selectively replace multiple instances of a character within a string
- Self-describing numbers
- Self numbers
- Send email
- 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
- Set consolidation
- Set of real numbers
- Set puzzle
- Set right-adjacent bits
- Seven-sided dice from five-sided dice
- Sexy primes
- Shoelace formula for polygonal area
- Short-circuit evaluation
- Shortest common supersequence
- Show ASCII table
- Sierpinski arrowhead curve
- Sierpinski pentagon
- Sierpinski square curve
- Sierpinski triangle/Graphical
- Simple database
- Simple turtle graphics
- Simple windowed application
- Simulate input/Keyboard
- Simulate input/Mouse
- Sleeping Beauty problem
- Smallest number k such that k+2^m is composite for all m less than k
- Smarandache prime-digital sequence
- Smith numbers
- Snake
- Sockets
- Sokoban
- Solve a Hidato puzzle
- Solve a Holy Knight's tour
- Solve a Hopido puzzle
- Solve a Numbrix puzzle
- Solve the no connection puzzle
- Sort a list of object identifiers
- Sort an outline at every level
- Sort disjoint sublist
- Sort numbers lexicographically
- Sort stability
- Sort three variables
- Sorting Algorithms/Circle Sort
- Sorting algorithms/Bead sort
- Sorting algorithms/Bogosort
- Sorting algorithms/Bubble sort
- Sorting algorithms/Cocktail sort
- Sorting algorithms/Cocktail sort with shifting bounds
- Sorting algorithms/Comb sort
- Sorting algorithms/Counting sort
- Sorting algorithms/Gnome sort
- Sorting algorithms/Heapsort
- Sorting algorithms/Merge sort
- Sorting algorithms/Pancake sort
- Sorting algorithms/Patience sort
- Sorting algorithms/Permutation sort
- Sorting algorithms/Radix sort
- Sorting algorithms/Shell sort
- Sorting algorithms/Stooge sort
- Sorting algorithms/Strand sort
- Soundex
- Sparkline in unicode
- Special characters
- Speech synthesis
- Spelling of ordinal numbers
- Spinning rod animation/Text
- Spiral matrix
- Split a character string based on change of character
- Square-free integers
- Square but not cube
- Square form factorization
- Stable marriage problem
- Stair-climbing puzzle
- State name puzzle
- Statistics/Normal distribution
- Stem-and-leaf plot
- Stirling numbers of the first kind
- Stirling numbers of the second kind
- Straddling checkerboard
- Strassen's algorithm
- Stream merge
- String interpolation (included)
- Strip block comments
- Strip control codes and extended characters from a string
- Strip whitespace from a string/Top and tail
- Strong and weak primes
- Substitution cipher
- Subtractive generator
- Successive prime differences
- Sudoku
- Suffixation of decimal numbers
- Sum and product puzzle
- Sum of elements below main diagonal of matrix
- Sum to 100
- Summarize and say sequence
- Summarize primes
- Super-d numbers
- Superellipse
- Superpermutation minimisation
- Sutherland-Hodgman polygon clipping
- Sylvester's sequence
- Symmetric difference
T
- Table creation/Postal addresses
- Take notes on the command line
- Tarjan
- Tau function
- Tau number
- Taxicab numbers
- Teacup rim text
- Terminal control/Clear the screen
- Terminal control/Coloured text
- Terminal control/Cursor movement
- Terminal control/Cursor positioning
- Terminal control/Dimensions
- Terminal control/Display an extended character
- Terminal control/Hiding the cursor
- Terminal control/Inverse video
- Terminal control/Positional read
- Terminal control/Preserve screen
- Terminal control/Ringing the terminal bell
- Terminal control/Unicode output
- Ternary logic
- Test integerness
- Text processing/1
- Text processing/2
- Text processing/Max licenses in use
- Textonyms
- The ISAAC Cipher
- The Name Game
- The Twelve Days of Christmas
- The sieve of Sundaram
- Thiele's interpolation formula
- Thue-Morse
- Tic-tac-toe
- Tokenize a string with escaping
- Tonelli-Shanks algorithm
- Topological sort
- Topswops
- Total circles area
- Totient function
- Trabb Pardo–Knuth algorithm
- Tree datastructures
- Tree from nesting levels
- Truncatable primes
- Truncate a file
- Truth table
- Twelve statements
- Twin primes
- Two bullet roulette
U
- UPC
- URL decoding
- URL encoding
- URL parser
- UTF-8 encode and decode
- Ukkonen’s suffix tree construction
- Ulam spiral (for primes)
- Ultra useful primes
- Unbias a random generator
- Unicode variable names
- Universal Turing machine
- Unix/ls
- Unprimeable numbers
- Untouchable numbers
- Update a configuration file
- Use another language to call a function
- User input/Graphical
V
- Validate International Securities Identification Number
- Vampire number
- Van Eck sequence
- Van der Corput sequence
- Variable-length quantity
- Variable declaration reset
- Variable size/Get
- Variable size/Set
- Vector
- Vector products
- Verhoeff algorithm
- Verify distribution uniformity/Chi-squared test
- Verify distribution uniformity/Naive
- Video display modes
- Vigenère cipher
- Vigenère cipher/Cryptanalysis
- Visualize a tree
- Vogel's approximation method
- Voronoi diagram
W
- Walk a directory/Non-recursively
- Walk a directory/Recursively
- War card game
- Water collected between towers
- Web scraping
- Weird numbers
- Wieferich primes
- Wilson primes of order n
- Window creation
- Window creation/X11
- Window management
- Wireworld
- Word frequency
- Word ladder
- Word search
- Word wheel
- Word wrap
- Wordiff
- World Cup group stage
- Write entire file
- Write float arrays to a text file
- Write language name in 3D ASCII
- Write to Windows event log
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 Oforth (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
- A* search algorithm
- ABC words
- ADFGVX cipher
- Addition-chain exponentiation
- Addition chains
- Air mass
- Alternade words
- Anadromes
- Append numbers at same position in strings
- Arithmetic coding/As a generalized change of radix
- Aspect oriented programming
- Assertions in design by contract
- Audio alarm
- Audio frequency generator
- Audio overlap loop
- Autogram checker
B
C
- CLI-based maze-game
- Camel case and snake case
- Card shuffles
- Change e letters to i in words
- Changeable words
- Chebyshev coefficients
- Checksumcolor
- Chemical calculator
- Chess player
- Cipolla's algorithm
- Code Golf: Code Golf
- Code segment unload
- Collect and sort square numbers in ascending order from three lists
- Combinations with repetitions/Square digit chain
- Common list elements
- Common sorted list
- Compiler/Preprocessor
- Compiler/Simple file inclusion pre processor
- Compiler/Verifying syntax
- Concatenate two primes is also prime
- Conjugate a Latin verb
- Continued fraction/Arithmetic/G(matrix ng, continued fraction n)
- Continued fraction/Arithmetic/G(matrix ng, continued fraction n1, continued fraction n2)
- Coprime triplets
- Coprimes
- Count how many vowels and consonants occur in a string
- Count the coins/0-1
- Cousin primes
- Create an object/Native demonstration
- Create your own text control codes
- Cubic special primes
- Curve that touches three points
- Cycle detection
- Cycles of a permutation
D
- Data Encryption Standard
- Dating agency
- Day of the week of Christmas and New Year
- Days between dates
- Decimal floating point number to binary
- Decision tables
- Digit fifth powers
- Diophantine linear system solving
- Discrete Fourier transform
- Distinct palindromes within decimal numbers
- Distinct power numbers
- Distribution of 0 digits in factorial series
- Divide a rectangle into a number of unequal triangles
- Dominoes
- Doomsday rule
- Doubly-linked list/Element removal
- Draw pixel 2
E
F
- Fibonacci heap
- Fibonacci matrix-exponentiation
- Find URI in text
- Find adjacent primes which differ by a square integer
- Find first and last set bit of a long integer
- Find first missing positive
- Find minimum number of coins that make a given value
- Find prime n such that reversed n is also prime
- Find prime numbers of the form n*n*n+2
- Find square difference
- Find squares n where n+1 is prime
- Find words which contain the most consonants
- Find words which contains all the vowels
- Find words which contains more than 3 e vowels
- Find words whose first and last three letters are equal
- Find words with alternating vowels and consonants
- Finite state machine
- First 9 prime Fibonacci number
- Four sides of square
- Free polyominoes enumeration
- Frobenius numbers
G
I
L
- Largest difference between adjacent primes
- Largest five adjacent number
- Largest palindrome product
- Largest prime factor
- Largest product in a grid
- Last list item
- Launch rocket with countdown and acceleration in stdout
- Length of an arc between two angles
- Line circle intersection
- Linux CPU utilization
- Logistic curve fitting in epidemiology
- Long stairs
- Longest common prefix
- Longest common suffix
- Longest palindromic substrings
- Longest substrings without repeating characters
M
- Make a backup file
- Markov chain text generator
- Matrix with two diagonals
- Maximum difference between adjacent elements of list
- Mersenne primes
- Minimum number of cells after, before, above and below NxN squares
- Minimum numbers of three lists
- Minimum primes
- Modulinos
- Montgomery reduction
- Morpion solitaire
- Mosaic matrix
- Most frequent k chars distance
- Multidimensional Newton-Raphson method
- Multiline shebang
- Multiton
N
- N-body problem
- N-queens minimum and knights and bishops
- NYSIIS
- Names to numbers
- Native shebang
- Neighbour primes
- Next special primes
- Nice primes
- Nimber arithmetic
- Number triplets game
- Numbers divisible by their individual digits, but not by the product of their digits.
- Numbers in base-16 representation that cannot be written with decimal digits
- Numbers in base 10 that are palindromic in bases 2, 4, and 16
- Numbers which binary and ternary digit sum are prime
- Numbers whose count of divisors is prime
- Numbers with prime digits whose sum is 13
- Numbers with same digit set in base 10 and base 16
- Numeric separator syntax
- Numerical integration/Adaptive Simpson's method
O
P
- Palindromic primes
- Palindromic primes in base 16
- Pandigital prime
- Parse EBNF
- Parse command-line arguments
- Particle swarm optimization
- Penrose tiling
- Perceptron
- Permutations with repetitions
- Permutations with some identical elements
- Permuted multiples
- Piprimes
- Polynomial derivative
- Polynomial synthetic division
- Positive decimal integers with the digit 1 occurring exactly twice
- Powerful numbers
- Practical numbers
- Price list behind API
- Prime numbers p for which the sum of primes less than or equal to p is prime
- Prime numbers which contain 123
- Prime triplets
- Prime words
- Primes which contain only one odd digit
- Primes whose first and last number is 3
- Primes whose sum of digits is 25
- Primes with digits in nondecreasing order
- Print debugging statement
- Print itself
- Process SMIL directives in XML data
- Product of divisors
- Proof
- Pseudorandom number generator image
R
- Railway circuit
- Ramanujan primes
- Ramsey's theorem
- Range modifications
- Raster bars
- Readline interface
- Recursive descent parser generator
- Red black tree sort
- Remote agent/Agent interface
- Remote agent/Agent logic
- Remote agent/Simulation
- Remove vowels from a string
- Resistance calculator
- Resistance network calculator
- Reverse the gender of a string
- Reverse the order of lines in a text file while preserving the contents of each line
- Robots
- Rodrigues’ rotation formula
- Rosetta Code/List authors of task descriptions
- Rosetta Code/Run examples
- Rosetta Code/Tasks without examples
- Round-robin tournament schedule
- Run as a daemon or service
S
- Safe and Sophie Germain primes
- Safe mode
- Sanitize user input
- Sattolo cycle
- Segmentation fault protection
- Selective file copy
- Self-hosting compiler
- Separate the house number from the street name
- Shift list elements to left by 3
- Show the (decimal) value of a number of 1s appended with a 3, then squared
- Sierpinski curve
- Simulated annealing
- Sine wave
- Singly-linked list/Element removal
- Smallest enclosing circle problem
- Smallest multiple
- Smallest numbers
- Smallest power of 6 whose decimal expansion contains n
- Smallest square that begins with n
- Snake and Ladder
- Solve a Rubik's Cube
- Solve equations with substitution method
- Solve hanging lantern problem
- Solve triangle solitare puzzle
- Solving coin problems
- Sort primes from list to a list
- Sort the letters of string in alphabetical order
- Sorting algorithms/Cycle sort
- Sorting algorithms/Tree sort on a linked list
- Special divisors
- Special factorials
- Special neighbor primes
- Special pythagorean triplet
- Spoof game
- Square root by hand
- Starting a web browser
- Steady squares
- Strange numbers
- Strange plus numbers
- Strange unique prime triplets
- Subset sum problem
- Substring primes
- Suffix tree
- Sum data type
- Sum of divisors
- Sum of first n cubes
- Sum of primes in odd positions is prime
- Sum of square and cube digits of an integer are primes
- Sum of the digits of n is substring of n
- Sum of two adjacent numbers are primes
- Summation of primes
- Sunflower fractal
T
- Table creation
- Tamagotchi emulator
- Terminal control/Restricted width positional input/No wrapping
- Terminal control/Restricted width positional input/With wrapping
- Tetris
- Text between
- Text completion
- Text to HTML
- Three word location
- Time-based one-time password algorithm
- Topological sort/Extracted top item
- Transliterate English text using the Greek alphabet
- Transportation problem
- Triplet of three numbers
- Tropical algebra overloading
- Two identical strings
- Two sum
- Type detection
U
W
Requiring Attention[edit]
Examples[edit]
These tasks have implementations in Oforth, 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 Oforth 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 Oforth was inappropriate for these tasks, or implementations of them would be unenlightening. Feel free to try your hand at them anyway.
End of List[edit]
Again, feel free to try your hand at any of the tasks listed on this page.