Carl H. Smith

According to our database1, Carl H. Smith authored at least 87 papers between 1974 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2018
The Seventh Ray: A Mixed Reality initiation experience.
Proceedings of the Electronic Visualisation and the Arts, 2018

2017
Natural Media Workshop.
Proceedings of the Electronic Visualisation and the Arts, 2017

Visions of an Imagined Venice Suspended Between Memories and New Possibilities.
Proceedings of the Electronic Visualisation and the Arts, 2017

2014
Context Engineering Hybrid Spaces for Perceptual Augmentation.
Proceedings of the Electronic Visualisation and the Arts, 2014

2013
Experience Communication through Post Digital Design.
Proceedings of the Electronic Visualisation and the Arts, 2013

2008
Learning with belief levels.
J. Comput. Syst. Sci., 2008

2003
On the intrinsic complexity of learning recursive functions.
Inf. Comput., 2003

2002
Learning by the Process of Elimination.
Inf. Comput., 2002

UPSILON: Universal Programming System with Incomplete Lazy Object Notation.
Fundam. Inform., 2002

Letter to the Editor.
AI Magazine, 2002

Category, Measure, Inductive Inference: A Triality Theorem and Its Applications.
Proceedings of the LATIN 2002: Theoretical Informatics, 2002

2001
Hierarchies of probabilistic and team FIN-learning.
Theor. Comput. Sci., 2001

On the role of search for learning from examples.
J. Exp. Theor. Artif. Intell., 2001

Robust Learning Is Rich.
J. Comput. Syst. Sci., 2001

Towards Axiomatic Basis of Inductive Inference.
Proceedings of the Fundamentals of Computation Theory, 13th International Symposium, 2001

2000
CS1 and CS2 (panel session): foundations of computer science and discrete mathematics.
Proceedings of the 31st SIGCSE Technical Symposium on Computer Science Education, 2000

1999
On the Inductive Inference of Recursive Real-Valued Functions.
Theor. Comput. Sci., 1999

The functions of finite support: a canonical learning problem.
J. Exp. Theor. Artif. Intell., 1999

Inductive Inference with Procrastination: Back to Definitions.
Fundam. Inform., 1999

On the Intrinsic Complexity of Learning Recursive Functions.
Proceedings of the Twelfth Annual Conference on Computational Learning Theory, 1999

1998
On the Relative Sizes of Learnable Sets.
Theor. Comput. Sci., 1998

A Logic of Discovery.
Proceedings of the Discovery Science, 1998

On the Power of Learning Robustly.
Proceedings of the Eleventh Annual Conference on Computational Learning Theory, 1998

Editor's Introduction.
Proceedings of the Algorithmic Learning Theory, 9th International Conference, 1998

1997
Classifying Predicates and Languages.
Int. J. Found. Comput. Sci., 1997

Learning Small Programs with Additional Information.
Proceedings of the Logical Foundations of Computer Science, 4th International Symposium, 1997

Learning Formulae from Elementary Facts.
Proceedings of the Computational Learning Theory, Third European Conference, 1997

Asymmetric Team Learning.
Proceedings of the Tenth Annual Conference on Computational Learning Theory, 1997

Team Learning as a Game.
Proceedings of the Algorithmic Learning Theory, 8th International Conference, 1997

1996
On Duality in Learning and the Selection of Learning Terms.
Inf. Comput., 1996

Learning with Confidence.
Proceedings of the STACS 96, 1996

General Inductive Inference Types Based on Linearly-Ordered Sets.
Proceedings of the STACS 96, 1996

1995
Training Digraphs.
Inf. Process. Lett., 1995

Learning via Queries with Teams and Anomalies.
Fundam. Inform., 1995

Recursion Theoretic Models of Learning: Some Results and Intuitions.
Ann. Math. Artif. Intell., 1995

Measure, Category and Learning Theory.
Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

Classifying Recursive Predicates and Languages.
Proceedings of the Algorithmic Learning for Knowledge-Based Systems, GOSLER Final Report, 1995

Probabilistic versus Deterministic Memory Limited Learning.
Proceedings of the Algorithmic Learning for Knowledge-Based Systems, GOSLER Final Report, 1995

On the intrinsic complexity of learning.
Proceedings of the Computational Learning Theory, Second European Conference, 1995

On the Inductive Inference of Real Valued Functions.
Proceedings of the Eigth Annual Conference on Computational Learning Theory, 1995

1994
Choosing a learning team: a topological approach.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

Co-Learning of Total Recursive Functions.
Proceedings of the Seventh Annual ACM Conference on Computational Learning Theory, 1994

Training Diagraphs.
Proceedings of the Algorithmic Learning Theory, 1994

Three Decades of Team Learning.
Proceedings of the Algorithmic Learning Theory, 1994

Co-learnability and FIN-identifiability of Enumerable Classes of Total Recursive Functions.
Proceedings of the Algorithmic Learning Theory, 1994

A recursive introduction to the theory of computation.
Graduate Texts in Computer Science, Springer, ISBN: 978-1-4419-8501-9, 1994

1993
On the Role of Procrastination in Machine Learning
Inf. Comput., December, 1993

The Syntax of Parallelism.
Fundam. Inform., 1993

On the impact of forgetting on learing machines.
Bulletin of the EATCS, 1993

On the impact of forgetting on learing machines.
Bulletin of the EATCS, 1993

On Learning Multiple Concepts in Parallel.
Proceedings of the Sixth Annual ACM Conference on Computational Learning Theory, 1993

On the Impact of Forgetting on Learning Machines.
Proceedings of the Sixth Annual ACM Conference on Computational Learning Theory, 1993

On the Duality Between Mechanistic Learners and What it is They Learn.
Proceedings of the Algorithmic Learning Theory, 4th International Workshop, 1993

1992
Memory Limited Inductive Inference Machines.
Proceedings of the Algorithm Theory, 1992

Generalization versus Classification.
Proceedings of the Fifth Annual ACM Conference on Computational Learning Theory, 1992

On the Role of Procrastination for Machine Learning.
Proceedings of the Fifth Annual ACM Conference on Computational Learning Theory, 1992

1991
On Weyuker's Axioms For Software Complexity Measures.
IEEE Trans. Software Eng., 1991

Self-learning inductive inference machines.
Computational Intelligence, 1991

1990
On the Inference of Approximate Programs.
Theor. Comput. Sci., 1990

Learning Via Queries With Teams and Anomilies.
Proceedings of the Third Annual Workshop on Computational Learning Theory, 1990

1989
Trade-Off among Parameters Effecting Inductive Inference
Inf. Comput., September, 1989

Training Sequences.
Theor. Comput. Sci., 1989

On the Role of Search for Learning.
Proceedings of the Second Annual Workshop on Computational Learning Theory, 1989

A Refutation of Barzdins' Conjecture.
Proceedings of the Analogical and Inductive Inference, 1989

Learning Programs With an Easy to Calculate Set of Errors.
Proceedings of the Analogical and Inductive Inference, 1989

1988
Probability and Plurality for Aggregations of Learning Machines
Inf. Comput., April, 1988

On the notion of granularity.
The Journal of Supercomputing, 1988

A note on arbitrarily complex recursive functions.
Notre Dame Journal of Formal Logic, 1988

Learning via Queries
Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988

Learning Programs with an Easy to Calculate Set of Errors.
Proceedings of the First Annual Workshop on Computational Learning Theory, 1988

Learning via Queries.
Proceedings of the First Annual Workshop on Computational Learning Theory, 1988

1987
A Recursion Theoretic Approach to Program Testing.
IEEE Trans. Software Eng., 1987

Probability and Plurality for Aggregations of Learning Machines.
Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987

1986
On the Complexity of Inductive Inference
Information and Control, 1986

On the Inference of Programs Approximately Computing the Desired Function.
Proceedings of the Analogical and Inductive Inference, 1986

On the Inference of Sequences of Functions.
Proceedings of the Analogical and Inductive Inference, 1986

1985
A complexity measure for data flow models.
International Journal of Parallel Programming, 1985

1984
A Proof of the Determinacy Property of the Data Flow Schema.
Inf. Process. Lett., 1984

On the complextiy of inductive inference.
Bulletin of the EATCS, 1984

On the Complexity of Inductive Inference (Preliminary Report).
Proceedings of the Mathematical Foundations of Computer Science 1984, 1984

1983
Inductive Inference: Theory and Methods.
ACM Comput. Surv., 1983

1982
A Combinatorial Problem Concerning Processor Interconnection Networks.
IEEE Trans. Computers, 1982

The Power of Pluralism for Automatic Program Synthesis.
J. ACM, 1982

1981
The Power of Parallelism for Automatic Program Synthesis
Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, 1981

1976
Memory Hardware for High Speed Job Selection.
IEEE Trans. Computers, 1976

1974
An Improved Bound for Detecting Looping Configurations in Deterministic DPA's.
Inf. Process. Lett., 1974

Discriminating Content Addressable Memories.
Proceedings of the Parallel Processing, Proceedings of the Sagamore Computer Conference, 1974


  Loading...