Abstract
This paper describes the logical nature of computing machines in terms of languages and the types of problems that can be solved by logical operations on languages. The problem of discovery in mathematics and empirical science is discussed, and an “inductive” machine is described which would be able to formulate hypotheses, modify them in the light of new experience and eventually discover the laws of a very simple universe.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Transactions of the I.R.E. Professional Group on Electronic Computers
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
