Complex information processing: a file structure for the complex, the changing and the indeterminate

@inproceedings{Nelson1965ComplexIP,
  title={Complex information processing: a file structure for the complex, the changing and the indeterminate},
  author={Theodor Holm Nelson},
  booktitle={ACM '65},
  year={1965}
}
  • T. Nelson
  • Published in ACM '65 24 August 1965
  • Computer Science
THE KINDS OF FILE structures required if we are to use the computer for personal files and as an adjunct to creativity are wholly different in character from those customary in business and scientific data processing. They need to provide the capacity for intricate and idiosyncratic arrangements, total modifiability, undecided alternatives, and thorough internal documentation. I want to explain how some ideas developed and what they are. The original problem was to specify a computer system… 

Representing Information About Files

We discuss the problem of fC['Jrcsenling inforn1,1lion about files. and as>cn that this differs from the problem of representing the conlents of fil.:s. Jilfonnalion about a Iilc is associated Wilh

Structural analysis for the knowledge management domain

A reanalysis of spatial hypertext applications designed to show the utility of the provided environments in terms of implementation, interoperability, or other metrics is presented, and its implications for spatialhypertext within structural computing environments are described.

AUTONOTE: A personal information storage and retrieval system

The user may enter a variety of textual materials and assign descriptors and phrases by which these materials may be retrieved, and the system has available mechanisms for deleting, replacing, linking, and hierarchically organizing text items.

Growth of relational model: Interdependence and complementary to big data

This paper aims to provide a complete model of a relational database that is still being widely used because of its well known ACID properties namely, atomicity, consistency, integrity and durability, to highlight the adoption of relational model approaches by bigdata techniques.

Information Extraction from HTML Documents Based on Logical Document Structure

This thesis proposes a novel approach to information extraction that is based on modeling the visual appearance of the document and proposes methods for using the logical structure model for the information extraction task based on tree matching algorithms.

The language documentation quartet

This paper discusses the progress in identifying how the four component parts of a description can be interlinked, what are the logical points at which to join them, and whether there are practical limits to how far this linking should be carried.

Note on the complexities of simple things such as a timeline

The composition of a timeline depends on purpose, perspective, and scale – and of the very understanding of the word, the phenomenon referred to, and whether the focus is the idea or concept, an

Theory and practice of the ternary relations model of information management

The TRM may be used to provide a substrate for building diverse systems, such as adaptive hypertext, schemaless database, query languages, hyperlink models and workflow management systems, and is by no means limited to these purposes.

Of Hoverboards and Hypertext

It has only been recently, with the advent of HTML5 and related standards, that the entirety of the NLS/Augment system can be implemented in the browser in a standardized fashion.

MESH: a model-based approach to hypermedia design

The purpose of the links is not only to model data interrelations; they also represent a navigational path throughout the resulting network structure, therefore, hypertext differs from other data.
...

References

SHOWING 1-10 OF 21 REFERENCES

A comparison of list-processing computer languages: including a detailed comparison of COMIT, IPL-V, LISP 1.5, and SLIP

A detailed comparison is presented of COMIT, IPL-V, LISP 1.5 and SLIP--four well-known computer programming languages which, among them, exhibit all the principal characteristics of existing list-processing languages, concluding that no one of the languages considered is distinctly superior in all possible llst-processing applications.

Multiword list items

This report describes the use of two or more consecutive words as one element, which results in a considerable saving in both the space required to hold a given amount of data, and in the execution time required to perform a given process on the data.

A general purpose programming system for random access memories

During the past ten years, information processing technology has made significant advances in many directions and applications now include the complete spectrum ranging from free-standing analytical programs to large complex information processing systems.

The Multi-List System for Real-Time Storage and Retrieval

Knotted list structures

The generalization consists essentially of replacing the thread link which Perlis and Thornton place in the R or link position of the last list cell of a list (or sub-list with a Control List which is attached to the list structure and which contains, among other information, a push down list capable of storing many thread links).

A Comparison of ListProcessing Languages.

  • Comm. ACM 7:4 (April,
  • 1964

The Bush Rapid Selector.

  • Datamation,
  • 1965

Experience with EDP Support of Individuals ’ File Maintenance

  • Evolution of Automated Writing . ” STWP Proceedings , May 1965 , no page numbers

A Comparison of List - Processing Languages

  • Comm . ACM
  • 1964