Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. Computer Science and Artificial Intelligence Lab (CSAIL)
  3. Artificial Intelligence Lab Publications
  4. AI Memos (1959 - 2004)
  5. Unrecognizable Sets of Numbers

Unrecognizable Sets of Numbers

Thumbnail Image
Download
Name

AIM-073.pdf

Size

211.93 KB

Format

Adobe PDF

Checksum (MD5)

d29a06dc22404a4cb3e038d8bbb6b383

Thumbnail Image
Download
Name

AIM-073.ps

Size

1.63 MB

Format

PostScript

Checksum (MD5)

bc785e121728d6ec8e8b23bbb2244e67

Author(s)
Minsky, Marvin
•
Papert, Seymour A.
Date Issued
November 1, 1964
Series/Report no.
AIM-073
Abstract
When 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.
Persistent DSpace Link
http://hdl.handle.net/1721.1/6115
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.