On summarizing data using probabilistic assertions
- 1 July 1977
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 23 (4) , 459-465
- https://doi.org/10.1109/tit.1977.1055756
Abstract
The complexity of question-answering systems which are permitted to submit probabilistic estimates of the truth of certain propositions is considered. Bounds are derived on the expected memory space and computational work required to produce probabilistic estimates of a specified quality. The general features of the bounds are similar to those of question-answering systems constrained to true-false type answers.Keywords
This publication has 5 references indexed in Scilit:
- On the Storage Economy of Inferential Question-Answering SystemsIEEE Transactions on Systems, Man, and Cybernetics, 1975
- Studies in Inductive Logic and Probability Volume 1Published by University of California Press ,1971
- Probabilistic Prediction: Some Experimental ResultsJournal of the American Statistical Association, 1971
- Three Measures of Decoder ComplexityIBM Journal of Research and Development, 1970
- Admissible Probability Measurement ProceduresPsychometrika, 1966