Programming the logic theory machine

LDR 01468nam a2200241K 4500
001 102670919
003 MiAaHDL
005 20240209000000.0
006 m d
007 cr bn ---auaua
008 951213s1957 cau 000 0 eng d
035 ‡asdr-hvd.990062865470203941
035 ‡a(MH)006286547HVD01-Aleph
035 ‡z(MH)Aleph006286547
035 ‡a(OCoLC)719927826
040 ‡aHLS ‡cHLS
100 1 ‡aNewell, Allen.
245 1 0 ‡aProgramming the logic theory machine / ‡c[by] A. Newell and J.C. Shaw. Feb. 1957. Rev.
260 ‡aSanta Monica, Calif., ‡c1957.
300 ‡a39 p. ‡billus.
490 0 ‡a[Rand Corporation. Paper] ‡vP-954
520 ‡aThe Logic Theory Machine (called LT, see P-951) represents a class of non-numerical problems with quite different programming requirements than either normal arithmetic calculations or business data processing. The storage requirements are extremely variable, with the results of many computations being changed in the memory structure. The program itself is a large, complicated hierarchy of subroutines. For LT an intermediate language (interpretive pseudo code) was written for the RAND JOHNNIAC. The paper first characterizes the programming problems involved and then illustrates solutions to them by describing the language. (Author).
538 ‡aMode of access: Internet.
690 9 ‡aElectronic calculating machines. ‡5wid
700 1 ‡aShaw, J. C.
776 0 8 ‡iOnline version: ‡aNewell, Allen. ‡tProgramming the logic theory machine. ‡dSanta Monica, Calif. : Rand Corporation, 1957 ‡w(OCoLC)1137222082
CID ‡a102670919
DAT 0 ‡a20020606163548.3 ‡b20240209000000.0
DAT 1 ‡a20240210060505.0 ‡b2024-02-10T14:15:42Z
DAT 2 ‡a2023-08-02T17:30:01Z ‡b2020-07-29T20:00:02Z
CAT ‡aSDR-HVD ‡chvd ‡dALMA ‡lprepare.pl-004-008
FMT ‡aBK
HOL ‡0sdr-hvd.990062865470203941 ‡ahvd ‡bSDR ‡cHVD ‡f006286547 ‡phvd.32044050818061 ‡sHVD ‡1990062865470203941
974 ‡bHVD ‡cHVD ‡d20240210 ‡sgoogle ‡uhvd.32044050818061 ‡y1957 ‡rund ‡qnfi