Research any topic before you write.

Find related topics.Discover entities.See connections.Build a topical map.

Dartmouth BASIC

Dartmouth BASIC is the original version of the BASIC programming language. It was designed by two professors at Dartmouth College, John G. Kemeny and Thomas E. Kurtz. With the underlying Dartmouth Time-Sharing System (DTSS), it offered an interactive programming environment to all undergraduates as well as the larger university community.

[EN, English, English]

History, Art, Measurement & Standards

Interactive map loads when it comes into view.
Use the mouse wheel or two fingers (on touchscreens) to zoom in and out of the map.

Research this topic

Explore the main themes, entities and connections around Dartmouth BASIC. Start with the topic map, then use the sections below for research and deeper semantic analysis.

Explore this topic

Start with a few of the strongest sections from the source topic. These are research directions, not a list of keywords you must use.

Key facts & relationships

High-confidence facts extracted from structured source data. Use them as anchors for further research.

Designed by
John G. Kemeny, Thomas E. Kurtz
First appeared
1964; 62 years ago (1964)
OS
Dartmouth Time-Sharing System
Paradigm
imperative, array

Topics to explore

A structured outline of related entities, concepts and subtopics. Open any item to build a new map centered on it.

Browse the full topic structure. Each item opens a new analysis centered on that subject.

Overview

Development history

Versions

DTSS interface

BASIC language

Bibliography

  • Bibcode Bibcode (identifier)
  • Doi Doi (identifier)
  • PMID PMID (identifier)
  • ISBN ISBN (identifier)
  • ACM Association for Computing Machinery

Advanced semantic analysis

Deeper signals for content research, entity SEO and topical coverage. The plain-language headings explain what each technical view is useful for.

Map overview Semantic statistics

Number of nodes, edges, triples, density and central hubs. Use it to gauge the size and connectivity of the map.

Dartmouth BASIC

Nodes117
Edges116
Triples9
Avg. degree1.98
Density0.017094
Components1

How this topic connects Entity context

Quick relationship hints grouped by predicate. Useful for spotting recurring semantic connections around the current entity.

See the strongest relationship patterns around the current topic before diving into the raw triples.

Dartmouth BASIC

Top relations

related to External links · 4
Dartmouth BASIC → Dartmouth BASIC Interpreter, Listing, RetroWiki, Scans
Designed by · 1
Dartmouth BASIC → John G. Kemeny, Thomas E. Kurtz
First appeared · 1
Dartmouth BASIC → 1964; 62 years ago (1964)
OS · 1
Dartmouth BASIC → Dartmouth Time-Sharing System
Paradigm · 1
Dartmouth BASIC → imperative, array
is a · 1
Dartmouth BASIC → original version of the BASIC programming language

Important terminology Word statistics

Frequent words and multi-word phrases across the lead, headings, infobox and body. Useful for terminology coverage.

Use these terms to understand the vocabulary surrounding the topic, not as a checklist for keyword stuffing.

Important terminology

basic dartmouth system version one would language time edition use number string new computer could also added kemeny used kurtz

Entity relationships Subject–Predicate–Object triples

Extracted RDF-like relationships with confidence and source. The table includes structured facts and lower-confidence contextual relations.
SubjectPredicateObjectConfidenceSrc
Dartmouth BASICDesigned byJohn G. Kemeny, Thomas E. Kurtz1.00infobox
Dartmouth BASICFirst appeared1964; 62 years ago (1964)1.00infobox
Dartmouth BASICOSDartmouth Time-Sharing System1.00infobox
Dartmouth BASICParadigmimperative, array1.00infobox
Dartmouth BASICis aoriginal version of the BASIC programming language0.90text
Dartmouth BASICrelated to External linksListing0.60section
Dartmouth BASICrelated to External linksScans0.60section
Dartmouth BASICrelated to External linksDartmouth BASIC Interpreter0.60section
Dartmouth BASICrelated to External linksRetroWiki0.60section

Related concept clusters Concept neighborhoods

Clusters of nearby vocabulary surrounding the topic. Scan them for adjacent concepts and language you may have missed.

These clusters group vocabulary that occurs around closely connected concepts in the source material.

    Connections between topic areas Semantic bridges

    Bridge nodes connect otherwise separate parts of the map. Expand a row to inspect the topic groups on each side.

    Bridges can reveal useful research angles that are easy to miss in a flat list of related terms.

    For writers, content strategists, SEOs, marketers and creators — from quick topic research to advanced semantic analysis.