Login / Signup

The complexity of countable categoricity in finite languages.

Aleksander Ivanov
Published in: Math. Log. Q. (2012)
Keyphrases
  • markov chain
  • neural network
  • expressive power
  • machine learning
  • real time
  • natural language
  • computational cost
  • upper bound
  • worst case
  • question answering
  • language identification
  • multi lingual
  • intrinsic complexity