Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/6115
Full metadata record
DC FieldValueLanguage
dc.creatorMinsky, Marvin-
dc.creatorPapert, Seymour-
dc.date2004-10-04T14:39:54Z-
dc.date2004-10-04T14:39:54Z-
dc.date1964-11-01-
dc.date.accessioned2013-10-09T02:43:04Z-
dc.date.available2013-10-09T02:43:04Z-
dc.date.issued2013-10-09-
dc.identifierAIM-073-
dc.identifierhttp://hdl.handle.net/1721.1/6115-
dc.identifier.urihttp://koha.mediu.edu.my:8181/xmlui/handle/1721-
dc.descriptionWhen is a set A of positive integers, represented as binary numbers, "regular" in the sense that it is a set of sequences that can be recognized by a finite-state machine? Let pie A(n) be the number of members of A less than the integer n. It is shown that the asymptotic behavior of pie A(n) is subject to severe restraints if A is regular. These constraints are violated by many important natural numerical sets whose distribution functions can be calculated, at least asymptotically. These include the set P of prime numbers for which pie P(n)~n/log n for large n, the set of integers A (k) of the form n to the power k for which pie A(k)(n)1/k, and many others. The technique cannot, however, yield a decision procedure for regularity since for every infinite regular set A there is a nonregular set A for which /pie Z(n)-pie A(n)/is less than or equal to 1, so that the asymptotic behaviors of the two distribution functions are essentially identical.-
dc.format1711310 bytes-
dc.format217016 bytes-
dc.formatapplication/postscript-
dc.formatapplication/pdf-
dc.languageen_US-
dc.relationAIM-073-
dc.titleUnrecognizable Sets of Numbers-
Appears in Collections:MIT Items

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.