Decidability and Universality in the Axiomatic Theory of Computability and Algorithms.
Mark BurginPublished in: Int. J. Found. Comput. Sci. (2012)
Keyphrases
- learning algorithm
- data structure
- computationally efficient
- recently developed
- computational efficiency
- mathematical foundations
- databases
- general theory
- linear algebra
- mathematical models
- computationally expensive
- cellular automata
- computational model
- benchmark datasets
- theoretical analysis
- significant improvement
- recommender systems
- decision trees