The MSO+U Theory of (N, <) Is Undecidable.
Mikolaj BojanczykPawel ParysSzymon TorunczykPublished in: STACS (2016)
Keyphrases
- sufficient conditions
- theoretical framework
- np complete
- neural network
- general theory
- genetic algorithm
- learning algorithm
- artificial intelligence
- decision trees
- finite state
- reinforcement learning
- computational complexity
- formal theory
- theoretical basis
- regular expressions
- pattern matching
- query language
- database
- bayesian networks
- database systems
- machine learning
- data sets