Need a good description here, particularly relating the defintion constrainted to contemporary times of Turing's post 1930s paper on general computability.
Elements found of interest
- A Turing Oracle is an interesting machine with theoretically infinite memory and the capability to answer any problem.
Algorithms I know which I should document:
- Binary Search Tree
Algorithms I would like to research further:
- B+ Index
- Hash Maps/Associative Hashing/Associative Memory
Concepts I need to research further:
- Algorithm complexity, especially in regards to asymptomic boundaries && Big-O notation.