RFC 2795: The Infinite Monkey Protocol Suite (IMPS)
In plain English — editorial summary, not part of the RFC
This memo describes a protocol suite which supports an infinite number of monkeys that sit at an infinite number of typewriters in order to determine when they have either produced the entire works of William Shakespeare or a good television show. This memo provides information for the Internet community.
Document record
- Document ID
- RFC2795
- Published
- April 2000
- Authors
- S. Christey
- Status
- INFORMATIONAL
- Stream
- INDEPENDENT
- Area
- —
- Pages
- 20
- Also known as
- —
Topics
Related documents
Ranked automatically by shared keywords, IETF area and stream — not by editorial selection.
- RFC 4777IBM's iSeries Telnet EnhancementsCurrent
November 2006
- RFC 8597Cooperating Layered Architecture for Software-Defined Networking (CLAS)Current
May 2019
- RFC 2784Generic Routing Encapsulation (GRE)Updated
March 2000
- RFC 2760Ongoing TCP Research Related to SatellitesCurrent
February 2000
- RFC 2757Long Thin NetworksCurrent
January 2000
- RFC 2847LIPKEY - A Low Infrastructure Public Key Mechanism Using SPKMCurrent
June 2000
- RFC 2852Deliver By SMTP Service ExtensionCurrent
June 2000
- RFC 2734IPv4 over IEEE 1394Current
December 1999
Also filed under
About this page
The document record above — title, authors, date, status, stream, area, relationships, DOI and errata — is imported verbatim from the public RFC Editor index. The “in plain English” section is editorial: written by The metasystema editorial team, not part of the RFC. Where the two differ, the RFC text governs.
Last checked against the RFC Editor index on . RFCs are never revised after publication; changes are issued as new documents.
Data sources · Editorial policy · Report a correction · What is an RFC?