| |
John Case was guest at University Kaiserslautern from May 19th to May 31th 1996.
He gave two talks.
Personal Information
- graduating with a B.S. in Physics at Iowa State University in 1964
- M.S. and Ph.D. in Mathematics at the University Illinois, Champaign-Urbana in 1966 and 1969
Research Interests:
Publications:
-
Synthesizing Enumeration Techniques For Language Learning
(with G. Baliga and
S. Jain),
Proceedings of the
Ninth Annual Conference in Computational Learning Theory,
1996, to appear (April 1, 1996 version).
-
Vacillatory and BC Learning on Noisy Data
(with S. Jain and
F. Stephan),
conference submission, April 1996.
-
Infinitary Self Reference in Learning Theory,
Journal of Experimental and Theoretical Artificial Intelligence,
6 (1994), 3-16.
-
Effectivizing Inseparability,
Zeitschrift fur Mathematische Logik und Grundlagen der
Mathematik, 37 (1991), 97-111.
-
Click here for Table of Contents and Chapter 1 of:
Subrecursive Programming Systems: Complexity & Succinctness
(with J. Royer),
research monograph
in the series Progress in Theoretical Computer Science,
Birkhauser Boston, 1994, 251pp, Hardcover $49.50,
ISBN 0-8176-3767-2, Phone: 1-800-777-4643,
Department Y807, P.O. Box 2485,
Secaucus, NJ 07096-2485 USA.
talks @ Kaiserslautern
colloquium talk: May 20th at 15:00
- Directions for Gold-Style Computational Learning Theory
Gold-Style Computational Learning Theory (COLT) provides a a relatively
abstract, but elegant and absolute account of the boundaries of learning
by algorithmic devices.
Some of the profound insights it provides are philosophical, some provide
heuristic advice to the designer of intelligent technology.
Surveyed will be some history and recent trends in Gold-Style COLT,
and some suggestions for future directions will be presented.
talk for the ML-workshop May 30th
- Propositional Self-Reference Revisited
Goedel's proof of his famous First Incompleteness Theorem featured, in
the context of arithmetic, what we will call propositional
self-reference. He created a sentence which asserted the unprovability of a
provably equivalent sentence. Feferman subsequently published a lemma
providing more general propositional self-reference.
Kleene's Strong Recursion Theorem, which has many applications in computability
theory, provides analogous self-reference, but for algorithms instead of
sentences.
In this talk we show how to prove a strong variant of Feferman's
Lemma from Kleene's Theorem and provide some new applications to arithmetic
which resemble applications of n-ary generalizations of Kleene's Theorem
in ordinary computability theory. For example, we prove an n-ary variant of
Rice's Theorem for definability in arithmetic.
Contacts:
Postal Address (@Delaware):
John Case
Department of Computer and Information Sciences
Smith Hall
University of Delaware
Phone/Fax:
+1-302-831-2714 (Phone)
+1-302-831-8458 (Fax)
Email:
case@cis.udel.edu
|
