Learning with the Knowledge of an Upper Bound on Program Size

@article{Jain1993LearningWT,
  title={Learning with the Knowledge of an Upper Bound on Program Size},
  author={Sanjay Jain and Arun Sharma},
  journal={Inf. Comput.},
  year={1993},
  volume={102},
  pages={118-166}
}
Two learning situations are considered: machine identification of programs from graphs of recursive functions (modeling inductive hypothesis formation) and machine identification of grammars from texts of recursively enumerable languages (modeling first language acquisition). Both these learning models are extended to account for situations in which a learning machine is provided additional information in the form of knowledge about an upper-bound on the minimal size program (grammar) for the… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 30 references

Similar Papers

Loading similar papers…