The Simple Proof Supporting the Findaings from the Logical Analysis of the Binary System Which disposes the Logical Dispute fostered by Modern Interpretation for Counting in Binary Notation
draft-terrell-simple-proof-support-logic-analy-bin-02
This document is an Internet-Draft (I-D).
Anyone may submit an I-D to the IETF.
This I-D is not endorsed by the IETF and has no formal standing in the
IETF standards process.
| Document | Type |
Expired Internet-Draft
(individual)
Expired & archived
|
|
|---|---|---|---|
| Author | Eugene Terrell | ||
| Last updated | 2001-12-14 | ||
| RFC stream | (None) | ||
| Intended RFC status | (None) | ||
| Formats | |||
| Stream | Stream state | (No stream defined) | |
| Consensus boilerplate | Unknown | ||
| RFC Editor Note | (None) | ||
| IESG | IESG state | Expired | |
| Telechat date | (None) | ||
| Responsible AD | (None) | ||
| Send notices to | (None) |
This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:
Abstract
The simple proof outlined in this presentation, regarding the Logical Analysis of the Binary System, and the argument concerning the Logical Derivation of the New Method for Enumeration, which disputes the Modern Interpretation for the Binary System, as being illogical and incorrect.
Authors
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)