home *** CD-ROM | disk | FTP | other *** search
/ NetNews Usenet Archive 1992 #18 / NN_1992_18.iso / spool / comp / ai / neuraln / 3188 < prev    next >
Encoding:
Internet Message Format  |  1992-08-13  |  883 b 
  1. Xref: sparky comp.ai.neural-nets:3188 comp.ai:3090 comp.compression:3009 comp.theory:1760
  2. Newsgroups: comp.ai.neural-nets,comp.ai,comp.compression,comp.theory
  3. Path: sparky!uunet!mcsun!sunic!palantir.p.tvt.se!infolog!peter@gbg.infolog.se
  4. From: peter@gbg.infolog.se (Peter Nordin)
  5. Subject: Re: measuring complexity (was Re: Kolmogorov Complexity)
  6. Message-ID: <1992Aug14.092545.14467@infolog.se>
  7. Sender: news@infolog.se
  8. Organization: Infologics AB
  9. References: <1992Aug10.163725.26986@julian.uwo.ca> <1992Aug10.115352.1@acad3.alaska.edu> <1992Aug12.150857.219@access.digex.com> <BsxrAq.5y7@exnet.co.uk>
  10. Date: Fri, 14 Aug 1992 09:25:45 GMT
  11. Lines: 9
  12.  
  13. I'm interested in the use of Kolmogorov complexity in Machine Learning and AI in general.
  14. Is there anyone who has good pointers to literature, conferences, mailing lists or alike.
  15.  
  16. Thanks
  17.  
  18. Peter Nordin
  19. Infologics AB
  20. peter@gbg.infolog.se
  21.  
  22.