DocumentCode :
888402
Title :
Decimal Numbers for Checking Summability
Author :
Bargainer, J.D. ; Coates, C.L.
Author_Institution :
Information Science Laboratory, Department of Electrical Engineering, University of Texas, Austin, Tex.
Issue :
3
fYear :
1966
fDate :
6/1/1966 12:00:00 AM
Firstpage :
372
Lastpage :
372
Abstract :
Assume that our technology uses "black boxes" that may be described by a planar figure. (See Fig. 1.) Each "box" has a finite number of inputs ordered in the manner shown in Fig. 1, from top to bottom on the left-hand side of the "box," and one output coming out of the right-hand side of the "box." The output is some function of the input variables. For the purpose of our discussion, the variables may be continuous or discrete or of any nature whatsoever, and each "box" may have any number of inputs.
Keywords :
Books; Boolean functions; Character recognition; Chebyshev approximation; Circuit testing; Circuit theory; Machine learning; Sufficient conditions; Switching circuits;
fLanguage :
English
Journal_Title :
Electronic Computers, IEEE Transactions on
Publisher :
ieee
ISSN :
0367-7508
Type :
jour
DOI :
10.1109/PGEC.1966.264496
Filename :
4038774
Link To Document :
بازگشت