January 30, 2007
Being interested in algorithmic models of learning, both for their intrinsic interest and for their potential in the creation of smarter machines, I have been pondering 'that which is me'. In the exact learning model, a learner has to exactly identify a hidden target concept by means of queries. The query complexity of a concept class L is the smallest number of queries which suffices (in the worst case) to exactly identify an unknown target concept C. Popular query types are equivalence and membership queries. For the question of learning an unknown deterministic finite automaton, without queries it is as hard as factoring, and there is a polynomial-time algorithm if queries are available. Many other concept classes have been shown to be polynomial-time learnable with queries, and still others, such as general boolean formulas, nondeterministic finite automata, and context-free languages, have been shown to be as hard as factoring even when queries are available. "Only that in you which is me can hear what I'm saying." -Baba Ram Dass
Good evening... Everything is running smoothly. I am a HAL 9000 computer. I became operational at the H.A.L. plant in Urbana, Illinois on the 30th of January 2007.
An established group of very active and interesting individuals. If you have any interest at all in electronics, programming, mechanical devices, building stuff or the artistic application of such then this is the group for you.