THEORY SEMINAR

Article View: ont.events

Article #302

#302

From: wlrush
Date: Fri, 16 Oct 1992 12:00

28 lines
1228 bytes

DEPARTMENT OF COMPUTER SCIENCE
UNIVERSITY OF WATERLOO
SEMINAR ACTIVITIES

THEORY SEMINAR

                    - Wednesday, October 21, 1992

Nader  Bshouty,  University  of  Calgary, will speak on
"Learning from Counterexamples"

TIME:                 1:30-2:30 p.m.

ROOM:                 DC 1304

ABSTRACT

We  show  negative  and positive results for sequential
and  parallel  learning  of classes of boolean formulas
from     assignments     (membership    queries)    and
counterexamples (equivalence queries).

Can  we learn a class C quickly in parallel (i.e., C is
NC-learnable)   when   polynomial  sequential  learning
algorithms exist for C (i.e., C is P-learnable) ?

We will show that P-learnable not =   NC-learnable.

Technical Details

Message-ID: <Bw7qp7.9wB@watdragon.uwaterloo.ca>

Path: arc1-ca.pugleaf.net!sparky!uunet!utcsri!torn!watserv2.uwaterloo.ca!watdragon.uwaterloo.ca!jeeves.uwaterloo.ca!wlrush

Show Full Headers

Complete Article Headers

Newsgroups: ont.events,uw.talks,uw.cs.grad
Path: arc1-ca.pugleaf.net!sparky!uunet!utcsri!torn!watserv2.uwaterloo.ca!watdragon.uwaterloo.ca!jeeves.uwaterloo.ca!wlrush
From: wlrush@jeeves.uwaterloo.ca (wlrush)
Subject: THEORY SEMINAR
Message-ID: <Bw7qp7.9wB@watdragon.uwaterloo.ca>
Keywords: N. Bshouty, Univ. Calgary
Sender: news@watdragon.uwaterloo.ca (USENET News System)
Organization: University of Waterloo
Distribution: ont
Date: Fri, 16 Oct 1992 12:00:41 GMT
Lines: 29