Pointer Machine, Partial Persistence, Full Persistence, Confluent Persistence, Retroactivity
- is a: 'Effective method'
- https://en.wikipedia.org/wiki/Algorithm
- fully defined procedure
- https://en.wikipedia.org/wiki/Iterative_method
- Algorithm which lacks certain things, eg. hyperparameters or termination criterion
- https://en.wikipedia.org/wiki/Heuristic
- uses 'educated guesses' or 'profiling'
- performance of heuristic depends on the data. there is no 'best' heuristic for all data sets
- https://en.wikipedia.org/wiki/Metaheuristic
- a method to select a heuristic based on data
- also see: 'no free lunch theorem'
- https://en.wikipedia.org/wiki/Distance
- a description of how to calculate the similarity or distance between two objects (numbers, vectors, strings, images, ...)
- https://en.wikipedia.org/wiki/Spigot_algorithm
- http://mathworld.wolfram.com/SpigotAlgorithm.html
- calculate mathematical constants to arbitrary precision with limited intermediate storage
- also called: 'Interruptible algorithm'
- https://en.wikipedia.org/wiki/Anytime_algorithm
- iterative algorithm were each steps improves the result. can be stopped anytime to get an approximation.
- https://en.wikipedia.org/wiki/Sequential_algorithm
- "executed sequentially – once through, from start to finish, without other processing executing – as opposed to concurrently or in parallel."
- cf: 'Streaming algorithm', 'Online algorithm'