最新资讯

  • 计算机现代史 | 从巴贝奇到电子计算机

计算机现代史 | 从巴贝奇到电子计算机

2026-02-04 22:52:58 栏目:最新资讯 9 阅读

注:本文为 “计算机的现代历史” 相关译文。
英文引文,机翻未校。


The Modern History of Computing

计算机现代史

First published Mon Dec 18, 2000; substantive revision Fri Jun 9, 2006

Historically, computers were human clerks who calculated in accordance with effective methods. These human computers did the sorts of calculation nowadays carried out by electronic computers, and many thousands of them were employed in commerce, government, and research establishments. The term computing machine, used increasingly from the 1920s, refers to any machine that does the work of a human computer, i.e., any machine that calculates in accordance with effective methods. During the late 1940s and early 1950s, with the advent of electronic computing machines, the phrase ‘computing machine’ gradually gave way simply to ‘computer’, initially usually with the prefix ‘electronic’ or ‘digital’. This entry surveys the history of these machines.
历史上,“computers”(计算机)是指按照有效方法进行计算的人类职员。这些人类计算机从事着如今由电子计算机完成的各类计算工作,成千上万个这样的职员受雇于商业、政府和研究机构。术语 computing machine(计算机器)自 1920 年代起使用日益增多,指任何执行人类计算机工作的机器,即任何按照有效方法进行计算的机器。1940 年代末至 1950 年代初,随着电子计算机器的出现,“computing machine” 这一短语逐渐让位于简单的 “computer”,起初通常带有 “electronic”(电子的)或 “digital”(数字的)前缀。本文概述这些机器的历史。

Babbage

巴贝奇

Charles Babbage was Lucasian Professor of Mathematics at Cambridge University from 1828 to 1839 (a post formerly held by Isaac Newton). Babbage’s proposed Difference Engine was a special-purpose digital computing machine for the automatic production of mathematical tables (such as logarithm tables, tide tables, and astronomical tables). The Difference Engine consisted entirely of mechanical components — brass gear wheels, rods, ratchets, pinions, etc. Numbers were represented in the decimal system by the positions of 10-toothed metal wheels mounted in columns. Babbage exhibited a small working model in 1822. He never completed the full-scale machine that he had designed but did complete several fragments. The largest — one ninth of the complete calculator — is on display in the London Science Museum. Babbage used it to perform serious computational work, calculating various mathematical tables. In 1990, Babbage’s Difference Engine No. 2 was finally built from Babbage’s designs and is also on display at the London Science Museum.
查尔斯 · 巴贝奇(Charles Babbage)于 1828 年至 1839 年担任剑桥大学卢卡斯数学教授(这一职位曾由艾萨克 · 牛顿担任)。巴贝奇提出的差分机(Difference Engine)是一种专用数字计算机器,用于自动生成数学表格(如对数表、潮汐表和天文表)。差分机完全由机械部件组成——黄铜齿轮、连杆、棘轮、小齿轮等。数字通过安装在立柱上的 10 齿金属轮的位置以十进制表示。巴贝奇于 1822 年展示了一个小型工作模型。他从未完成自己设计的全尺寸机器,但确实完成了几个部件。其中最大的——占完整计算器的九分之一——现陈列于伦敦科学博物馆。巴贝奇曾用它进行严肃的运算工作,计算各种数学表格。1990 年,巴贝奇的差分机 2 号终于根据其设计图纸建造完成,也陈列于伦敦科学博物馆。

The Swedes Georg and Edvard Scheutz (father and son) constructed a modified version of Babbage’s Difference Engine. Three were made, a prototype and two commercial models, one of these being sold to an observatory in Albany, New York, and the other to the Registrar-General’s office in London, where it calculated and printed actuarial tables.
瑞典人乔治 · 沙伊茨和爱德华 · 沙伊茨(父子)建造了巴贝奇差分机的一个改进版本。共制造了三台,一台原型机和两台商业机型,其中一台售予纽约奥尔巴尼的一座天文台,另一台售予伦敦的登记总局,用于计算和印刷保险统计表。

Babbage’s proposed Analytical Engine, considerably more ambitious than the Difference Engine, was to have been a general-purpose mechanical digital computer. The Analytical Engine was to have had a memory store and a central processing unit (or ‘mill’) and would have been able to select from among alternative actions consequent upon the outcome of its previous actions (a facility nowadays known as conditional branching). The behaviour of the Analytical Engine would have been controlled by a program of instructions contained on punched cards connected together with ribbons (an idea that Babbage had adopted from the Jacquard weaving loom). Babbage emphasised the generality of the Analytical Engine, saying ‘the conditions which enable a finite machine to make calculations of unlimited extent are fulfilled in the Analytical Engine’ (Babbage [1994], p. 97).
巴贝奇提出的分析机(Analytical Engine)远比差分机雄心勃勃,本将成为一台通用机械数字计算机。分析机本应拥有存储器和中央处理单元(或称 “mill”),并能够根据其先前行为的结果在多种备选动作中进行选择(这一功能如今称为条件分支)。分析机的行为将由穿孔卡片上的指令程序控制,这些卡片用带子连接在一起(这一想法是巴贝奇从雅卡尔提花织机借鉴而来的)。巴贝奇强调了分析机的通用性,他说:“使有限机器能够进行无限范围计算的条件,在分析机中得到了满足”(Babbage [1994],第 97 页)。

Babbage worked closely with Ada Lovelace, daughter of the poet Byron, after whom the modern programming language ADA is named. Lovelace foresaw the possibility of using the Analytical Engine for non-numeric computation, suggesting that the Engine might even be capable of composing elaborate pieces of music.
巴贝奇与诗人拜伦之女阿达 · 洛夫莱斯(Ada Lovelace)密切合作,现代编程语言 Ada 即以她命名。洛夫莱斯预见到使用分析机进行非数值计算的可能性,提出该机器甚至可能能够创作复杂的音乐作品。

A large model of the Analytical Engine was under construction at the time of Babbage’s death in 1871 but a full-scale version was never built. Babbage’s idea of a general-purpose calculating engine was never forgotten, especially at Cambridge, and was on occasion a lively topic of mealtime discussion at the war-time headquarters of the Government Code and Cypher School, Bletchley Park, Buckinghamshire, birthplace of the electronic digital computer.
1871 年巴贝奇去世时,分析机的一个大型模型正在建造中,但全尺寸版本从未建成。巴贝奇关于通用计算引擎的想法从未被遗忘,尤其在剑桥,它偶尔成为白金汉郡布莱切利园政府密码学校战时总部餐桌上热烈讨论的话题——布莱切利园正是电子数字计算机的诞生地。

Analog computers

模拟计算机

The earliest computing machines in wide use were not digital but analog. In analog representation, properties of the representational medium ape (or reflect or model) properties of the represented state-of-affairs. (In obvious contrast, the strings of binary digits employed in digital representation do not represent by means of possessing some physical property — such as length — whose magnitude varies in proportion to the magnitude of the property that is being represented.) Analog representations form a diverse class. Some examples: the longer a line on a road map, the longer the road that the line represents; the greater the number of clear plastic squares in an architect’s model, the greater the number of windows in the building represented; the higher the pitch of an acoustic depth meter, the shallower the water. In analog computers, numerical quantities are represented by, for example, the angle of rotation of a shaft or a difference in electrical potential. Thus the output voltage of the machine at a time might represent the momentary speed of the object being modelled.
最早广泛使用的计算机器并非数字式的,而是模拟式的。在模拟表示中,表示媒介的属性模仿(或反映、或建模)被表示事态的属性。(形成明显对比的是,数字表示中使用的二进制数字串 并不 通过拥有某种与被表示属性大小成比例的物理属性——如长度——来进行表示。)模拟表示构成一个多样的类别。例如:地图上的一条线越长,它所表示的道路就越长;建筑师模型中透明塑料方格越多,所表示建筑的窗户就越多;声学测深仪的音调越高,水就越浅。在模拟计算机中,数值量通过例如轴的旋转角度或电位差来表示。因此,机器在某时刻的输出电压可能代表被建模物体的瞬时速度。

As the case of the architect’s model makes plain, analog representation may be discrete in nature (there is no such thing as a fractional number of windows). Among computer scientists, the term ‘analog’ is sometimes used narrowly, to indicate representation of one continuously-valued quantity by another (e.g., speed by voltage). As Brian Cantwell Smith has remarked:
正如建筑师模型的例子所清楚表明的,模拟表示在本质上可能是 离散的(不存在分数个窗户这种东西)。在计算机科学家中,术语 “analog” 有时被狭义地使用,表示用一个 连续值 量表示另一个连续值量(例如用电压表示速度)。正如 Brian Cantwell Smith 所言:

‘Analog’ should … be a predicate on a representation whose structure corresponds to that of which it represents … That continuous representations should historically have come to be called analog presumably betrays the recognition that, at the levels at which it matters to us,世界比我们想象的更为基础性地连续而非离散。 (Smith [1991], p. 271)

“Analog” 应当……是用来描述一种表示的谓词,其结构对应于它所表示之物的结构……连续表示在历史上被称为 analog,大概反映了一种认识:在我们所关注的层面上,世界比我们想象的更为基础性地连续而非离散。(Smith [1991],第 271 页)

James Thomson, brother of Lord Kelvin, invented the mechanical wheel-and-disc integrator that became the foundation of analog computation (Thomson [1876]). The two brothers constructed a device for computing the integral of the product of two given functions, and Kelvin described (although did not construct) general-purpose analog machines for integrating linear differential equations of any order and for solving simultaneous linear equations. Kelvin’s most successful analog computer was his tide predicting machine, which remained in use at the port of Liverpool until the 1960s. Mechanical analog devices based on the wheel-and-disc integrator were in use during World War I for gunnery calculations. Following the war, the design of the integrator was considerably improved by Hannibal Ford (Ford [1919]).
开尔文勋爵之弟詹姆斯 · 汤姆森(James Thomson)发明了机械轮盘积分器,这成为模拟计算的基础(Thomson [1876])。兄弟俩建造了一种计算两个给定函数乘积积分的装置,开尔文还描述了(尽管未建造)用于积分任意阶线性微分方程和求解联立线性方程的通用模拟机器。开尔文最成功的模拟计算机是他的潮汐预测机,该机器在利物浦港一直使用到 1960 年代。基于轮盘积分器的机械模拟装置在第一次世界大战期间用于火炮计算。战后,汉尼拔 · 福特(Hannibal Ford)大幅改进了积分器的设计(Ford [1919])。

Stanley Fifer reports that the first semi-automatic mechanical analog computer was built in England by the Manchester firm of Metropolitan Vickers prior to 1930 (Fifer [1961], p. 29); however, I have so far been unable to verify this claim. In 1931, Vannevar Bush, working at MIT, built the differential analyser, the first large-scale automatic general-purpose mechanical analog computer. Bush’s design was based on the wheel and disc integrator. Soon copies of his machine were in use around the world (including, at Cambridge and Manchester Universities in England, differential analysers built out of kit-set Meccano, the once popular engineering toy).
斯坦利 · 法伊弗(Stanley Fifer)报告称,第一台半自动机械模拟计算机由曼彻斯特的大都会维克斯公司于 1930 年前在英国建造(Fifer [1961],第 29 页);然而,我迄今未能核实这一说法。1931 年,万尼瓦尔 · 布什(Vannevar Bush)在麻省理工学院工作时建造了微分分析仪,这是第一台大型自动通用机械模拟计算机。布什的设计基于轮盘积分器。很快,他的机器的复制品在世界各地投入使用(包括在英国剑桥大学和曼彻斯特大学,用曾经流行的工程玩具 Meccano 套件组装的微分分析仪)。

It required a skilled mechanic equipped with a lead hammer to set up Bush’s mechanical differential analyser for each new job. Subsequently, Bush and his colleagues replaced the wheel-and-disc integrators and other mechanical components by electromechanical, and finally by electronic, devices.
每次为新任务设置布什的机械微分分析仪,都需要一名配备铅锤的熟练技工。随后,布什及其同事将轮盘积分器和其他机械部件替换为机电装置,最终替换为电子装置。

A differential analyser may be conceptualised as a collection of ‘black boxes’ connected together in such a way as to allow considerable feedback. Each box performs a fundamental process, for example addition, multiplication of a variable by a constant, and integration. In setting up the machine for a given task, boxes are connected together so that the desired set of fundamental processes is executed. In the case of electrical machines, this was done typically by plugging wires into sockets on a patch panel (computing machines whose function is determined in this way are referred to as ‘program-controlled’).
微分分析仪可概念化为由"黑箱"组成的集合,这些黑箱以允许大量反馈的方式相互连接。每个黑箱执行一个基本过程,例如加法、变量乘以常数、积分。在为给定任务设置机器时,黑箱被连接在一起,从而执行所需的基本过程集合。对于电子机器,这通常通过将导线插入插线板上的插孔来完成(以这种方式确定功能的计算机器称为"程序控制")。

Since all the boxes work in parallel, an electronic differential analyser solves sets of equations very quickly. Against this has to be set the cost of massaging the problem to be solved into the form demanded by the analog machine, and of setting up the hardware to perform the desired computation. A major drawback of analog computation is the higher cost, relative to digital machines, of an increase in precision. During the 1960s and 1970s, there was considerable interest in ‘hybrid’ machines, where an analog section is controlled by and programmed via a digital section. However, such machines are now a rarity.
由于所有黑箱并行工作,电子微分分析仪能非常快速地求解方程组。但另一方面,需要付出代价:将待解问题改造为模拟机器所要求的形式,以及设置硬件以执行所需计算。模拟计算的一个主要缺点是,相对于数字机器,提高精度的成本更高。1960 年代和 1970 年代,人们对"混合"机器(模拟部分由数字部分控制和编程)相当感兴趣。然而,这种机器如今已十分罕见。

The Universal Turing Machine

通用图灵机

In 1936, at Cambridge University, Turing invented the principle of the modern computer. He described an abstract digital computing machine consisting of a limitless memory and a scanner that moves back and forth through the memory, symbol by symbol, reading what it finds and writing further symbols (Turing [1936]). The actions of the scanner are dictated by a program of instructions that is stored in the memory in the form of symbols. This is Turing’s stored-program concept, and implicit in it is the possibility of the machine operating on and modifying its own program. (In London in 1947, in the course of what was, so far as is known, the earliest public lecture to mention computer intelligence, Turing said, ‘What we want is a machine that can learn from experience’, adding that the ‘possibility of letting the machine alter its own instructions provides the mechanism for this’ (Turing [1947] p. 393). Turing’s computing machine of 1936 is now known simply as the universal Turing machine. Cambridge mathematician Max Newman remarked that right from the start Turing was interested in the possibility of actually building a computing machine of the sort that he had described (Newman in interview with Christopher Evans in Evans [197?].
1936 年,在剑桥大学,图灵发明了现代计算机的原理。他描述了一种抽象的数字计算机器,由无限存储器和一个在存储器中来回移动的扫描器组成,扫描器逐个符号地读取所发现的内容并写入更多符号(Turing [1936])。扫描器的动作由以符号形式存储在存储器中的指令程序所支配。这就是图灵的存储程序概念,其中隐含了机器对自身程序进行操作和修改的可能性。(1947 年在伦敦,据已知最早的提及计算机智能的公开讲座中,图灵说:“我们想要的是一台能从经验中学习的机器”,并补充道"让机器改变自身指令的可能性为此提供了机制"(Turing [1947] 第 393 页)。图灵 1936 年的计算机器如今简称为通用图灵机。剑桥数学家马克斯 · 纽曼(Max Newman)评论说,图灵从一开始就对实际建造他所描述的那种计算机器感兴趣(纽曼在接受 Christopher Evans 采访时,见 Evans [197?])。

From the start of the Second World War Turing was a leading cryptanalyst at the Government Code and Cypher School, Bletchley Park. Here he became familiar with Thomas Flowers’ work involving large-scale high-speed electronic switching (described below). However, Turing could not turn to the project of building an electronic stored-program computing machine until the cessation of hostilities in Europe in 1945.
第二次世界大战伊始,图灵就成为布莱切利园政府密码学校的首席密码分析员。在这里,他熟悉了托马斯 · 弗劳尔斯(Thomas Flowers)关于大规模高速电子开关的工作(见下文描述)。然而,直到 1945 年欧洲敌对行动停止,图灵才得以着手建造电子存储程序计算机器的项目。

During the wartime years Turing did give considerable thought to the question of machine intelligence. Colleagues at Bletchley Park recall numerous off-duty discussions with him on the topic, and at one point Turing circulated a typewritten report (now lost) setting out some of his ideas. One of these colleagues, Donald Michie (who later founded the Department of Machine Intelligence and Perception at the University of Edinburgh), remembers Turing talking often about the possibility of computing machines (1) learning from experience and (2) solving problems by means of searching through the space of possible solutions, guided by rule-of-thumb principles (Michie in interview with Copeland, 1995). The modern term for the latter idea is ‘heuristic search’, a heuristic being any rule-of-thumb principle that cuts down the amount of searching required in order to find a solution to a problem. At Bletchley Park Turing illustrated his ideas on machine智能 by reference to chess. Michie recalls Turing experimenting with heuristics that later became common in chess programming (in particular minimax and best-first).
战时岁月中,图灵确实对机器智能问题给予了大量思考。布莱切利园的同事们回忆起与他多次在下班时间讨论这一话题,图灵曾一度传阅一份打字报告(现已遗失)阐述他的一些想法。其中一位同事唐纳德 · 米奇(Donald Michie,后创立爱丁堡大学机器智能与感知系)记得图灵经常谈论计算机器的可能性:(1) 从经验中学习,(2) 通过在有解空间中搜索来解决问题,由经验法则指导(米奇 1995 年接受 Copeland 采访时所述)。后者的现代术语是"启发式搜索",启发式是指任何减少寻找问题解所需搜索量的经验法则。在布莱切利园,图灵以国际象棋为例说明他对机器智能的想法。米奇回忆图灵曾实验后来在国际象棋编程中常见的启发式方法(特别是极小化极大法和最佳优先法)。

Further information about Turing and the computer, including his wartime work on codebreaking and his thinking about artificial intelligence and artificial life, can be found in Copeland 2004.
关于图灵与计算机的更多信息,包括他战时破译密码的工作以及他对人工智能和人工生命的思考,可参见 Copeland 2004。

Electromechanical versus Electronic Computation

机电与电子计算

With some exceptions — including Babbage’s purely mechanical engines, and the finger-powered National Accounting Machine - early digital computing machines were electromechanical. That is to say, their basic components were small, electrically-driven, mechanical switches called ‘relays’. These operate relatively slowly, whereas the basic components of an electronic computer — originally vacuum tubes (valves) — have no moving parts save electrons and so operate extremely fast. Electromechanical digital computing machines were built before and during the second world war by (among others) Howard Aiken at Harvard University, George Stibitz at Bell Telephone Laboratories, Turing at Princeton University and Bletchley Park, and Konrad Zuse in Berlin. To Zuse belongs the honour of having built the first working general-purpose program-controlled digital computer. This machine, later called the Z3, was functioning in 1941. (A program-controlled computer, as opposed to a stored-program computer, is set up for a new task by re-routing wires, by means of plugs etc.)
除少数例外——包括巴贝奇纯机械引擎和手指驱动的国民会计机——早期数字计算机器是机电式的。也就是说,它们的基本部件是称为"继电器"的小型电动机械开关。这些开关运行相对较慢,而电子计算机的基本部件——最初是真空管(电子管)——除电子外没有活动部件,因此运行极快。机电数字计算机器在二战前和二战期间由(其中包括)哈佛大学的霍华德 · 艾肯(Howard Aiken)、贝尔电话实验室的乔治 · 斯蒂比茨(George Stibitz)、普林斯顿大学和布莱切利园的图灵,以及柏林的康拉德 · 楚泽(Konrad Zuse)建造。楚泽享有建造第一台可工作的通用程序控制数字计算机的荣誉。这台机器后来称为 Z3,于 1941 年投入运行。(程序控制计算机与存储程序计算机不同,前者通过重新布线、使用插头等为新任务进行设置。)

Relays were too slow and unreliable a medium for large-scale general-purpose digital computation (although Aiken made a valiant effort). It was the development of high-speed digital techniques using vacuum tubes that made the modern computer possible.
继电器作为大规模通用数字计算的介质太慢且不可靠(尽管艾肯做了英勇努力)。正是使用真空管的高速数字技术的发展使现代计算机成为可能。

The earliest extensive use of vacuum tubes for digital data-processing appears to have been by the engineer Thomas Flowers, working in London at the British Post Office Research Station at Dollis Hill. Electronic equipment designed by Flowers in 1934, for controlling the connections between telephone exchanges, went into operation in 1939, and involved between three and four thousand vacuum tubes running continuously. In 1938–1939 Flowers worked on an experimental electronic digital data-processing system, involving a high-speed data store. Flowers’ aim, achieved after the war, was that electronic equipment should replace existing, less reliable, systems built from relays and used in telephone exchanges. Flowers did not investigate the idea of using electronic equipment for numerical calculation, but has remarked that at the outbreak of war with Germany in 1939 he was possibly the only person in Britain who realized that vacuum tubes could be used on a large scale for high-speed digital computation. (See Copeland 2006 for m more information on Flowers’ work.)
真空管最早广泛用于数字数据处理似乎是由工程师托马斯 · 弗劳尔斯(Thomas Flowers)完成的,他在伦敦多利斯山的英国邮政总局研究站工作。弗劳尔斯 1934 年设计的用于控制电话交换局之间连接的电子设备于 1939 年投入运行,涉及 3000 至 4000 根连续运行的真空管。1938–1939 年,弗劳尔斯致力于一个实验性电子数字数据处理系统,涉及高速数据存储器。弗劳尔斯的目标——战后得以实现——是使电子设备取代现有的、可靠性较低的、由继电器构成并用于电话交换局的系统。弗劳尔斯没有研究使用电子设备进行数值计算的想法,但他曾评论说,1939 年对德战争爆发时,他可能是英国唯一意识到真空管可大规模用于高速数字计算的人。(关于弗劳尔斯工作的更多信息,参见 Copeland 2006。)

Atanasoff

阿塔纳索夫

The earliest comparable use of vacuum tubes in the U.S. seems to have been by John Atanasoff at what was then Iowa State College (now University). During the period 1937–1942 Atanasoff developed techniques for using vacuum tubes to perform numerical calculations digitally. In 1939, with the assistance of his student Clifford Berry, Atanasoff began building what is sometimes called the Atanasoff-Berry Computer, or ABC, a small-scale special-purpose electronic digital machine for the solution of systems of linear algebraic equations. The machine contained approximately 300 vacuum tubes. Although the electronic part of the machine functioned successfully, the computer as a whole never worked reliably, errors being introduced by the unsatisfactory binary card-reader. Work was discontinued in 1942 when Atanasoff left Iowa State.
美国最早可比拟的真空管使用似乎是由约翰 · 阿塔纳索夫(John Atanasoff)在当时的艾奥瓦州立学院(今大学)完成的。1937–1942 年期间,阿塔纳索夫发展了使用真空管进行数字数值计算的技术。1939 年,在其学生克利福德 · 贝里(Clifford Berry)的协助下,阿塔纳索夫开始建造有时称为阿塔纳索夫-贝里计算机(Atanasoff-Berry Computer)或 ABC 的机器,这是一台小型专用电子数字机器,用于求解线性代数方程组。该机器包含约 300 根真空管。尽管机器的电子部分成功运行,但整台计算机从未可靠工作,不令人满意的二进制卡片读入器引入了错误。1942 年阿塔纳索夫离开艾奥瓦州立大学时,工作中止。

Colossus

巨人机

The first fully functioning electronic digital computer was Colossus, used by the Bletchley Park cryptanalysts from February 1944.
第一台完全可运行的电子数字计算机是巨人机(Colossus),自 1944 年 2 月起由布莱切利园的密码分析员使用。

From very early in the war the Government Code and Cypher School (GC&CS) was successfully deciphering German radio communications encoded by means of the Enigma system, and by early 1942 about 39,000 intercepted messages were being decoded each month, thanks to electromechanical machines known as ‘bombes’. These were designed by Turing and Gordon Welchman (building on earlier work by Polish cryptanalysts).
战争初期,政府密码学校(GC&CS)就成功地破译了使用恩尼格玛(Enigma)系统加密的德国无线电通信,到 1942 年初,每月约有 39,000 条截获信息被破译,这归功于称为"炸弹"(bombes)的机电机器。这些机器由图灵和戈登 · 韦尔奇曼(Gordon Welchman)设计(基于波兰密码分析员的前期工作)。

During the second half of 1941, messages encoded by means of a totally different method began to be intercepted. This new cipher machine, code-named ‘Tunny’ by Bletchley Park, was broken in April 1942 and current traffic was read for the first time in July of that year. Based on binary teleprinter code, Tunny was used in preference to Morse-based Enigma for the encryption of high-level signals, for example messages from Hitler and members of the German High Command.
1941 年下半年,开始截获用完全不同方法加密的信息。这台新的密码机被布莱切利园代号为"金枪鱼"(Tunny),于 1942 年 4 月被攻破,同年 7 月首次读出当前通信。金枪鱼基于二进制电传打字机代码,优先于基于莫尔斯电码的恩尼格玛用于高级信号的加密,例如来自希特勒和德国最高统帅部成员的消息。

The need to decipher this vital intelligence as rapidly as possible led Max Newman to propose in November 1942 (shortly after his recruitment to GC&CS from Cambridge University) that key parts of the decryption process be automated, by means of high-speed electronic counting devices. The first machine designed and built to Newman’s specification, known as the Heath Robinson, was relay-based with electronic circuits for counting. (The electronic counters were designed by C.E. Wynn-Williams, who had been using thyratron tubes in counting circuits at the Cavendish Laboratory, Cambridge, since 1932 [Wynn-Williams 1932].) Installed in June 1943, Heath Robinson was unreliable and slow, and its high-speed paper tapes were continually breaking, but it proved the worth of Newman’s idea. Flowers recommended that an all-electronic machine be built instead, but he received no official encouragement from GC&CS. Working independently at the Post Office Research Station at Dollis Hill, Flowers quietly got on with constructing the world’s first large-scale programmable electronic digital computer. Colossus I was delivered to Bletchley Park in January 1943.
尽快破译这一重要情报的需要使马克斯 · 纽曼于 1942 年 11 月(他从剑桥大学被招募到 GC&CS 后不久)提议通过高速电子计数装置将解密过程的关键部分自动化。第一台按照纽曼规格设计和建造的机器称为希思 · 鲁滨逊(Heath Robinson),采用继电器并带有电子计数电路。(电子计数器由 C.E. 温-威廉斯设计,他自 1932 年起就在剑桥卡文迪许实验室使用闸流管计数电路 [Wynn-Williams 1932]。)希思 · 鲁滨逊于 1943 年 6 月安装,它不可靠且速度慢,高速纸带不断断裂,但它证明了纽曼想法的价值。弗劳尔斯建议建造一台全电子机器,但未获得 GC&CS 的官方支持。弗劳尔斯在多利斯山邮政总局研究站独立工作,悄然着手建造世界上第一台大规模可编程电子数字计算机。巨人机 I 号于 1943 年 1 月交付布莱切利园。

By the end of the war there were ten Colossi working round the clock at Bletchley Park. From a cryptanalytic viewpoint, a major difference between the prototype Colossus I and the later machines was the addition of the so-called Special Attachment, following a key discovery by cryptanalysts Donald Michie and Jack Good. This broadened the function of Colossus from ‘wheel setting’ — i.e., determining the settings of the encoding wheels of the Tunny machine for a particular message, given the ‘patterns’ of the wheels — to ‘wheel breaking’, i.e., determining the wheel patterns themselves. The wheel patterns were eventually changed daily by the Germans on each of the numerous links between the German Army High Command and Army Group commanders in the field. By 1945 there were as many 30 links in total. About ten of these were broken and read regularly.
战争结束时,布莱切利园有 10 台巨人机日夜工作。从密码分析角度看,原型巨人机 I 号与后来机器的一个主要区别是所谓"特殊附件"的增加,这是继密码分析员唐纳德 · 米奇和杰克 · 古德(Jack Good)的关键发现之后添加的。这将巨人机的功能从"轮设置"——即给定轮子的"模式"后,确定金枪鱼机器在特定信息中的编码轮设置——扩展到"破轮",即确定轮子模式本身。德国最高统帅部与野战集团军指挥官之间的众多通信线路中,每条线路的轮子模式最终被德国人每天更换。到 1945 年,总共有约 30 条线路。其中约 10 条被定期攻破和阅读。

Colossus I contained approximately 1600 vacuum tubes and each of the subsequent machines approximately 2400 vacuum tubes. Like the smaller ABC, Colossus lacked two important features of modern computers. First, it had no internally stored programs. To set it up for a new task, the operator had to alter the machine’s physical wiring, using plugs and switches. Second, Colossus was not a general-purpose machine, being designed for a specific cryptanalytic task involving counting and Boolean operations.
巨人机 I 号包含约 1600 根真空管,后续每台机器约 2400 根真空管。与较小的 ABC 一样,巨人机缺少现代计算机的两个重要特征。首先,它没有内部存储程序。要将其设置为新任务,操作员必须使用插头和开关改变机器的物理线路。其次,巨人机不是通用机器,而是为涉及计数和布尔运算的特定密码分析任务设计的。

F.H. Hinsley, official historian of GC&CS, has estimated that the war in Europe was shortened by at least two years as a result of the signals intelligence operation carried out at Bletchley Park, in which Colossus played a major role. Most of the Colossi were destroyed once hostilities ceased. Some of the electronic panels ended up at Newman’s Computing Machine Laboratory in Manchester (see below), all trace of their original use having been removed. Two Colossi were retained by GC&CS (renamed GCHQ following the end of the war). The last Colossus is believed to have stopped running in 1960.
GC&CS 的官方历史学家 F.H. 欣斯利(F.H. Hinsley)估计,由于在布莱切利园进行的信号情报行动(其中巨人机发挥了重要作用),欧洲战争至少缩短了两年。敌对行动停止后,大多数巨人机被销毁。一些电子面板最终流入纽曼在曼彻斯特的计算机器实验室(见下文),其原始用途的所有痕迹都被抹去。GC&CS(战后更名为 GCHQ)保留了两台巨人机。最后一台巨人机据信于 1960 年停止运行。

Those who knew of Colossus were prohibited by the Official Secrets Act from sharing their knowledge. Until the 1970s, few had any idea that electronic computation had been used successfully during the second world war. In 1970 and 1975, respectively, Good and Michie published notes giving the barest outlines of Colossus. By 1983, Flowers had received clearance from the British Government to publish a partial account of the hardware of Colossus I. Details of the later machines and of the Special Attachment, the uses to which the Colossi were put, and the cryptanalytic algorithms that they ran, have only recently been declassified. (For the full account of Colossus and the attack on Tunny see Copeland 2006.)
了解巨人机的人被《官方保密法》禁止分享其知识。直到 1970 年代,很少有人知道电子计算在二战期间已成功使用。古德和米奇分别于 1970 年和 1975 年发表了笔记,给出了巨人机的最简略轮廓。到 1983 年,弗劳尔斯获得英国政府批准,可发表关于巨人机 I 号硬件的部分描述。后来机器的详情、特殊附件、巨人机的用途以及它们运行的密码分析算法,直到最近才解密。(关于巨人机和对金枪鱼攻击的完整描述,参见 Copeland 2006。)

To those acquainted with the universal Turing machine of 1936, and the associated stored-program concept, Flowers’ racks of digital electronic equipment were proof of the feasibility of using large numbers of vacuum tubes to implement a high-speed general-purpose stored-program computer. The war over, Newman lost no time in establishing the Royal Society Computing Machine Laboratory at Manchester University for precisely that purpose. A few months after his arrival at Manchester, Newman wrote as follows to the Princeton mathematician John von Neumann (February 1946):
对于熟悉 1936 年通用图灵机及相关存储程序概念的人来说,弗劳尔斯的数字电子设备架证明了使用大量真空管实现高速通用存储程序计算机的可行性。战争一结束,纽曼立即在曼彻斯特大学建立皇家学会计算机器实验室,正是为此目的。抵达曼彻斯特几个月后,纽曼于 1946 年 2 月致信普林斯顿数学家约翰 · 冯 · 诺伊曼(John von Neumann):

I am … hoping to embark on a computing machine section here, having got very interested in electronic devices of this kind during the last two or three years. By about eighteen months ago I had decided to try my hand at starting up a machine unit when I got out. … I am of course in close touch with Turing.

我……希望在这里着手建立一个计算机器部门,在过去两三年里我对这类电子设备非常感兴趣。大约 18 个月前,我决定在出去后尝试建立一个机器单元。……我当然与图灵保持密切联系。

Turing’s Automatic Computing Engine

图灵的自动计算引擎

Turing and Newman were thinking along similar lines. In 1945 Turing joined the National Physical Laboratory (NPL) in London, his brief to design and develop an electronic stored-program digital computer for scientific work. (Artificial Intelligence was not far from Turing’s thoughts: he described himself as ‘building a brain’ and remarked in a letter that he was ‘more interested in the possibility of producing models of the action of the brain than in the practical applications to computing’.) John Womersley, Turing’s immediate superior at NPL, christened Turing’s proposed machine the Automatic Computing Engine, or ACE, in homage to Babbage’s Difference Engine and Analytical Engine.
图灵和纽曼的思路相似。1945 年,图灵加入伦敦国家物理实验室(NPL),其任务是为科学工作设计并开发电子存储程序数字计算机。(人工智能离图灵的想法不远:他形容自己"在建造一个大脑",并在信中评论说"我对制造大脑活动模型的可能性比对计算的实际应用更感兴趣"。)图灵在 NPL 的直属上级约翰 · 沃默斯利(John Womersley)将图灵提议的机器命名为自动计算引擎(Automatic Computing Engine,ACE),以向巴贝奇的差分机和分析机致敬。

Turing’s 1945 report ‘Proposed Electronic Calculator’ gave the first relatively complete specification of an electronic stored-program general-purpose digital computer. The report is reprinted in full in Copeland 2005.
图灵 1945 年的报告《提议的电子计算器》(“Proposed Electronic Calculator”)首次给出了电子存储程序通用数字计算机的相对完整规格。该报告全文重印于 Copeland 2005。

The first electronic stored-program digital computer to be proposed in the U.S. was the EDVAC (see below). The ‘First Draft of a Report on the EDVAC’ (May 1945), composed by von Neumann, contained little engineering detail, in particular concerning electronic hardware (owing to restrictions in the U.S.). Turing’s ‘Proposed Electronic Calculator’, on the other hand, supplied detailed circuit designs and specifications of hardware units, specimen programs in machine code, and even an estimate of the cost of building the machine (£11,200). ACE and EDVAC differed fundamentally from one another; for example, ACE employed distributed processing, while EDVAC had a centralised structure.
美国提议的第一台电子存储程序数字计算机是 EDVAC(见下文)。冯 · 诺伊曼撰写的《关于 EDVAC 的报告初稿》(“First Draft of a Report on the EDVAC”,1945 年 5 月)包含很少的工程细节,特别是关于电子硬件的细节(由于美国的限制)。另一方面,图灵的《提议的电子计算器》提供了详细的电路设计和硬件单元规格、机器代码的示例程序,甚至建造机器的估计成本(11,200 英镑)。ACE 和 EDVAC 在根本上彼此不同;例如,ACE 采用分布式处理,而 EDVAC 采用集中式结构。

Turing saw that speed and memory were the keys to computing. Turing’s colleague at NPL, Jim Wilkinson, observed that Turing ‘was obsessed with the idea of speed on the machine’ [Copeland 2005, p. 2]. Turing’s design had much in common with today’s RISC architectures and it called for a high-speed memory of roughly the same capacity as an early Macintosh computer (enormous by the standards of his day). Had Turing’s ACE been built as planned it would have been in a different league from the other early computers. However, progress on Turing’s Automatic Computing Engine ran slowly, due to organisational difficulties at NPL, and in 1948 a ‘very fed up’ Turing (Robin Gandy’s description, in interview with Copeland, 1995) left NPL for Newman’s Computing Machine Laboratory at Manchester University. It was not until May 1950 that a small pilot model of the Automatic Computing Engine, built by Wilkinson, Edward Newman, Mike Woodger, and others, first executed a program. With an operating speed of 1 MHz, the Pilot Model ACE was for some time the fastest computer in the world.
图灵认为速度和存储器是计算的关键。图灵在 NPL 的同事吉姆 · 威尔金森(Jim Wilkinson)观察到,图灵"痴迷于机器速度的想法"[Copeland 2005,第 2 页]。图灵的设计与今天的 RISC 架构有很多共同之处,它要求的高速存储器容量大致与早期的麦金塔计算机相当(按当时的标准来说是巨大的)。如果图灵的 ACE 按计划建成,它将与其他早期计算机处于完全不同的级别。然而,由于 NPL 的组织困难,图灵自动计算引擎的进展缓慢,1948 年,"非常沮丧"的图灵(罗宾 · 甘迪的描述,1995 年接受 Copeland 采访时)离开 NPL 前往纽曼在曼彻斯特大学的计算机器实验室。直到 1950 年 5 月,由威尔金森、爱德华 · 纽曼、迈克 · 伍杰(Mike Woodger)等人建造的自动计算引擎的小型试点模型才首次执行程序。试点模型 ACE 的运行速度为 1 MHz,一度是世界上最快的计算机。

Sales of DEUCE, the production version of the Pilot Model ACE, were buoyant — confounding the suggestion, made in 1946 by the Director of the NPL, Sir Charles Darwin, that ‘it is very possible that … one machine would suffice to solve all the problems that are demanded of it from the whole country’ [Copeland 2005, p. 4]. The fundamentals of Turing’s ACE design were employed by Harry Huskey (at Wayne State University, Detroit) in the Bendix G15 computer (Huskey in interview with Copeland, 1998). The G15 was arguably the first personal computer; over 400 were sold worldwide. DEUCE and the G15 remained in use until about 1970. Another computer deriving from Turing’s ACE design, the MOSAIC, played a role in Britain’s air defences during the Cold War period; other derivatives include the Packard-Bell PB250 (1961). (More information about these early computers is given in [Copeland 2005].)
试点模型 ACE 的生产版本 DEUCE 的销售十分兴旺——这与 NPL 主任查尔斯 · 达尔文爵士 1946 年提出的建议相悖,他认为"很有可能……一台机器就足以解决全国要求它解决的所有问题"[Copeland 2005,第 4 页]。图灵 ACE 设计的基本原理被哈里 · 哈斯基(Harry Huskey,在底特律韦恩州立大学)用于 Bendix G15 计算机(哈斯基 1998 年接受 Copeland 采访时所述)。G15 可以说是第一台个人计算机;全球售出 400 多台。DEUCE 和 G15 一直使用到约 1970 年。另一台源自图灵 ACE 设计的计算机 MOSAIC,在冷战期间英国的防空系统中发挥了作用;其他衍生产品包括 Packard-Bell PB250(1961 年)。(关于这些早期计算机的更多信息,见 [Copeland 2005]。)

The Manchester Machine

曼彻斯特机

The earliest general-purpose stored-program electronic digital computer to work was built in Newman’s Computing Machine Laboratory at Manchester University. The Manchester ‘Baby’, as it became known, was constructed by the engineers F.C. Williams and Tom Kilburn, and performed its first calculation on 21 June 1948. The tiny program, stored on the face of a cathode ray tube, was just seventeen instructions long. A much enlarged version of the machine, with a programming system designed by Turing, became the world’s first commercially available computer, the Ferranti Mark I. The first to be completed was installed at Manchester University in February 1951; in all about ten were sold, in Britain, Canada, Holland and Italy.
最早可工作的通用存储程序电子数字计算机建于纽曼在曼彻斯特大学的计算机器实验室。这台被称为曼彻斯特"婴儿机"(Baby)的机器由工程师 F.C. 威廉斯(F.C. Williams)和汤姆 · 基尔伯恩(Tom Kilburn)建造,于 1948 年 6 月 21 日执行了首次计算。这个存储在阴极射线管表面的微小程序只有 17 条指令长。这台机器的一个大幅扩展版本,带有图灵设计的编程系统,成为世界上第一台商业可用计算机,即费兰蒂 Mark I(Ferranti Mark I)。第一台完成的机器于 1951 年 2 月安装在曼彻斯特大学;总共售出约 10 台,销往英国、加拿大、荷兰和意大利。

The fundamental logico-mathematical contributions by Turing and Newman to the triumph at Manchester have been neglected, and the Manchester machine is nowadays remembered as the work of Williams and Kilburn. Indeed, Newman’s role in the development of computers has never been sufficiently emphasised (due perhaps to his thoroughly self-effacing way of relating the relevant events).
图灵和纽曼对曼彻斯特胜利的根本性逻辑数学贡献被忽视了,如今曼彻斯特机被铭记为威廉斯和基尔伯恩的作品。事实上,纽曼在计算机发展中的作用从未得到充分强调(或许由于他讲述相关事件时完全谦逊的方式)。

It was Newman who, in a lecture in Cambridge in 1935, introduced Turing to the concept that led directly to the Turing machine: Newman defined a constructive process as one that a machine can carry out (Newman in interview with Evans, op. cit.). As a result of his knowledge of Turing’s work, Newman became interested in the possibilities of computing machinery in, as he put it, ‘a rather theoretical way’. It was not until Newman joined GC&CS in 1942 that his interest in计算机器突然变得实际, with his realisation that the attack on Tunny could be mechanised. During the building of Colossus, Newman tried to interest Flowers in Turing’s 1936 paper — birthplace of the stored-program concept - but Flowers did not make much of Turing’s arcane notation. There is no doubt that by 1943, Newman had firmly in mind the idea of using electronic technology in order to construct a stored-program general-purpose digital computing machine.
正是纽曼在 1935 年剑桥的一次讲座中,向图灵介绍了直接导致图灵机诞生的概念:纽曼将构造性过程定义为 机器 可以执行的过程(纽曼在接受 Evans 采访时,同上)。由于对图灵工作的了解,纽曼对计算机器的可能性产生了兴趣,用他的话说,是以"一种相当理论的方式"。直到 1942 年纽曼加入 GC&CS,他对计算机器的兴趣才突然变得实际,他意识到对金枪鱼的攻击可以机械化。在建造巨人机期间,纽曼试图让弗劳尔斯对图灵 1936 年的论文——存储程序概念的发源地——产生兴趣,但弗劳尔斯对图灵深奥的符号学没太在意。毫无疑问,到 1943 年,纽曼已牢固确立了使用电子技术建造存储程序通用数字计算机器的想法。

In July of 1946 (the month in which the Royal Society approved Newman’s application for funds to found the Computing Machine Laboratory), Freddie Williams, working at the Telecommunications Research Establishment, Malvern, began the series of experiments on cathode ray tube storage that was to lead to the Williams tube memory. Williams, until then a radar engineer, explains how it was that he came to be working on the problem of computer memory:
1946 年 7 月(皇家学会批准纽曼建立计算机器实验室资金申请的当月),在马尔文电信研究 Establishment 工作的弗雷迪 · 威廉斯(Freddie Williams)开始了关于阴极射线管存储的一系列实验,这将导致威廉斯管存储器的诞生。此前一直担任雷达工程师的威廉斯解释了他如何开始研究计算机存储器问题:

[O]nce [the German Armies] collapsed … nobody was going to care a toss about radar, and people like me … were going to be in the soup unless we found something else to do. And computers were in the air. Knowing absolutely nothing about them I latched onto the problem of storage and tackled that. (Quoted in Bennett 1976.)

“[德国军队]一旦崩溃……就没有人会再关心雷达了,像我这样的人……除非找到别的事做,否则就要倒霉了。而计算机正炙手可热。对它们一无所知的我,抓住了存储问题并着手解决。”(引自 Bennett 1976。)

Newman learned of Williams’ work, and with the able help of Patrick Blackett, Langworthy Professor of Physics at Manchester and one of the most powerful figures in the University, was instrumental in the appointment of the 35 year old Williams to the recently vacated Chair of Electro-Technics at Manchester. (Both were members of the appointing committee (Kilburn in interview with Copeland, 1997).) Williams immediately had Kilburn, his assistant at Malvern, seconded to Manchester. To take up the story in Williams’ own words:
纽曼得知了威廉斯的工作,并在曼彻斯特大学朗沃西物理学教授、该校最有权势的人物之一帕特里克 · 布莱克特(Patrick Blackett)的有力帮助下,促成了 35 岁的威廉斯被任命到曼彻斯特最近空缺的电技术教授职位。(两人都是任命委员会的成员(基尔伯恩 1997 年接受 Copeland 采访时所述)。)威廉斯立即将他在马尔文的助手基尔伯恩借调到曼彻斯特。用威廉斯自己的话继续说:

[N]either Tom Kilburn nor I knew the first thing about computers when we arrived in Manchester University. We’d had enough explained to us to understand what the problem of storage was and what we wanted to store, and that we’d achieved, so the point now had been reached when we’d got to find out about computers … Newman explained the whole business of how a computer works to us. (F.C. Williams in interview with Evans [1976])

“汤姆 · 基尔伯恩和我刚到曼彻斯特大学时,对计算机一无所知。我们已得到足够多的解释,理解了存储问题是什么以及我们想存储什么,而且我们已经实现了这一点,所以现在已经到了必须了解计算机的时候了……纽曼向我们解释了计算机如何工作的全部业务。”(F.C. Williams 接受 Evans [1976] 采访时)

Elsewhere Williams is explicit concerning Turing’s role and gives something of the flavour of the explanation that he and Kilburn received:
在别处,威廉斯明确提到了图灵的作用,并给出了他和基尔伯恩所接受的解释的一些风味:

Tom Kilburn and I knew nothing about computers, but a lot about circuits. Professor Newman and Mr A.M. Turing … knew a lot about computers and substantially nothing about electronics. They took us by the hand and explained how numbers could live in houses with addresses and how if they did they could be kept track of during a calculation. (Williams [1975], p. 328)

“汤姆 · 基尔伯恩和我不了解计算机,但很懂电路。纽曼教授和 A.M. 图灵先生……很懂计算机,但基本上不懂电子学。他们拉着我们的手,解释了数字如何可以住在有地址的房子里,如果这样做,如何在计算过程中跟踪它们。”(Williams [1975],第 328 页)

It seems that Newman must have used much the same words with Williams and Kilburn as he did in an address to the Royal Society on 4th March 1948:
看来纽曼对威廉斯和基尔伯恩使用的措辞,与他在 1948 年 3 月 4 日对皇家学会的致辞中使用的非常相似:

Professor Hartree … has recalled that all the essential ideas of the general-purpose calculating machines now being made are to be found in Babbage’s plans for his analytical engine. In modern times the idea of a universal calculating machine was independently introduced by Turing … [T]he machines now being made in America and in this country … [are] in certain general respects … all similar. There is provision for storing numbers, say in the scale of 2, so that each number appears as a row of, say, forty 0’s and 1’s in certain places or “houses” in the machine. … Certain of these numbers, or “words” are read, one after another, as orders. In one possible type of machine an order consists of four numbers, for example 11, 13, 27, 4. The number 4 signifies “add”, and when control shifts to this word the “houses” H11 and H13 will be connected to the adder as inputs, and H27 as output. The numbers stored in H11 and H13 pass through the adder, are added, and the sum is passed on to H27. The control then shifts to the next order. In most real machines the process just described would be done by three separate orders, the first bringing [H11] (=content of H11) to a central accumulator, the second adding [H13] into the accumulator, and the third sending the result to H27; thus only one address would be required in each order. … A machine with storage, with this automatic-telephone-exchange arrangement and with the necessary adders, subtractors and so on, is, in a sense, already a universal machine. (Newman [1948], pp. 271–272)

“哈特里教授……曾回忆,现在制造的通用计算机器的所有基本思想都可以在巴贝奇分析机的计划中找到。在现代,通用计算机器的思想由图灵独立提出……[美国]和[本国]现在正在制造的机器……在某些一般方面……都是相似的。有存储数字的装置,比如说以 2 为基数,使每个数字在机器的某些位置或"房子"中显示为一行,比如说 40 个 0 和 1……这些数字或"字"中的某些被依次读出,作为指令。在一种可能的机器类型中,一条指令由四个数字组成,例如 11, 13, 27, 4。数字 4 表示"加”,当控制转移到这个字时,“房子"H11 和 H13 将作为输入连接到加法器,H27 作为输出。存储在 H11 和 H13 中的数字通过加法器,相加,和传递给 H27。然后控制转移到下一条指令。在大多数实际机器中,刚才描述的过程将由三条独立指令完成,第一条将 [H11](= H11 的内容)带到中央累加器,第二条将 [H13] 加到累加器中,第三条将结果发送到 H27;因此每条指令只需要一个地址……具有存储器、具有这种自动电话交换安排以及具有必要的加法器、减法器等的机器,在某种意义上已经是一台通用机器。”(Newman [1948],第 271–272 页)

Following this explanation of Turing’s three-address concept (source 1, source 2, destination, function) Newman went on to describe program storage (‘the orders shall be in a series of houses X1, X2, …’) and conditional branching. He then summed up:
在解释了图灵的三地址概念(源 1、源 2、目的地、功能)之后,纽曼继续描述程序存储(“指令应在一系列房子 X1, X2, …… 中”)和条件分支。然后他总结道:

From this highly simplified account it emerges that the essential internal parts of the machine are, first, a storage for numbers (which may also be orders). … Secondly, adders, multipliers, etc. Thirdly, an “automatic telephone exchange” for selecting “houses”, connecting them to the arithmetic organ, and writing the answers in other prescribed houses. Finally, means of moving control at any stage to any chosen order, if a certain condition is satisfied, otherwise passing to the next order in the normal sequence. Besides these there must be ways of setting up the machine at the outset, and extracting the final answer in useable form. (Newman [1948], pp. 273–4)

“从这个高度简化的描述中可以看出,机器的基本内部部件首先是数字存储器(也可以是指令)。……其次是加法器、乘法器等。第三,用于选择"房子”、将它们连接到算术器官、并将答案写入其他指定房子的"自动电话交换"。最后,如果在任何阶段满足某个条件,则将控制转移到任何选定指令的手段,否则按正常顺序传递到下一条指令。除此之外,还必须有在开始时设置机器的方法,以及以可用形式提取最终答案的方法。"(Newman [1948],第 273–4 页)

In a letter written in 1972 Williams described in some detail what he and Kilburn were told by Newman:
在 1972 年写的一封信中,威廉斯详细描述了他和基尔伯恩从纽曼那里听到的内容:

About the middle of the year [1946] the possibility of an appointment at Manchester University arose and I had a talk with Professor Newman who was already interested in the possibility of developing computers and had acquired a grant from the Royal Society of £30,000 for this purpose. Since he understood computers and I understood electronics the possibilities of fruitful collaboration were obvious. I remember Newman giving us a few lectures in which he outlined the organisation of a computer in terms of numbers being identified by the address of the house in which they were placed and in terms of numbers being transferred from this address, one at a time, to an accumulator where each entering number was added to what was already there. At any time the number in the accumulator could be transferred back to an assigned address in the store and the accumulator cleared for further use. The transfers were to be effected by a stored program in which a list of instructions was obeyed sequentially. Ordered progress through the list could be interrupted by a test instruction which examined the sign of the number in the accumulator. Thereafter operation started from a new point in the list of instructions. This was the first information I received about the organisation of computers. … Our first computer was the simplest embodiment of these principles, with the sole difference that it used a subtracting rather than an adding accumulator. (Letter from Williams to Randell, 1972; in Randell [1972], p. 9)

“大约在 [1946 年] 年中,出现了在曼彻斯特大学任职的可能性,我与纽曼教授进行了交谈,他那时已经对开发计算机的可能性感兴趣,并已从皇家学会获得 30,000 英镑的资助用于此目的。由于他懂计算机而我懂电子学,富有成效合作的可能性是显而易见的。我记得纽曼给我们做了几次讲座,他在讲座中概述了计算机的组织结构,即数字通过它们所在房子的地址来识别,数字从这个地址一次一个地转移到累加器,在那里每个进入的数字被加到已有的数字上。任何时候,累加器中的数字都可以转移回存储器中指定的地址,累加器被清空以供进一步使用。转移将由存储程序实现,其中一系列指令被顺序执行。通过列表的有序进行可以被一条测试指令中断,该指令检查累加器中数字的符号。此后操作从指令列表的新点开始。这是我收到的关于计算机组织的第一个信息。……我们的第一台计算机是这些原理的最简单体现,唯一的区别是它使用减法累加器而不是加法累加器。”(威廉斯致兰德尔的信,1972 年;见 Randell [1972],第 9 页)

Turing’s early input to the developments at Manchester, hinted at by Williams in his above-quoted reference to Turing, may have been via the lectures on computer design that Turing and Wilkinson gave in London during the period December 1946 to February 1947 (Turing and Wilkinson [1946–7]). The lectures were attended by representatives of various organisations planning to use or build an electronic computer. Kilburn was in the audience (Bowker and Giordano [1993]). (Kilburn usually said, when asked from where he obtained his basic knowledge of the computer, that he could not remember (letter from Brian Napper to Copeland, 2002); for example, in a 1992 interview he said: ‘Between early 1945 and early 1947, in that period, somehow or other I knew what a digital computer was … Where I got this knowledge from I’ve no idea’ (Bowker and Giordano [1993], p. 19).)
图灵对曼彻斯特发展的早期投入,在威廉斯上述提及图灵的引文中有所暗示,可能是通过图灵和威尔金森于 1946 年 12 月至 1947 年 2 月期间在伦敦所做的计算机设计讲座(Turing and Wilkinson [1946–7])。这些讲座有计划使用或建造电子计算机的各个组织的代表参加。基尔伯恩也在听众中(Bowker and Giordano [1993])。(当被问及他从哪里获得计算机的基本知识时,基尔伯恩通常说他记不清了(Brian Napper 2002 年致 Copeland 的信);例如,在 1992 年的一次采访中他说:“1945 年初到 1947 年初,在那段时期,不知怎么的我知道数字计算机是什么……我从哪里获得这些知识的,我毫无头绪”(Bowker and Giordano [1993],第 19 页)。)

Whatever role Turing’s lectures may have played in informing Kilburn, there is little doubt that credit for the Manchester computer — called the ‘Newman-Williams machine’ in a contemporary document (Huskey 1947) — belongs not only to Williams and Kilburn but also to Newman, and that the influence on Newman of Turing’s 1936 paper was crucial, as was the influence of Flowers’ Colossus.
无论图灵的讲座在向基尔伯恩传授知识方面发挥了什么作用,毫无疑问,曼彻斯特计算机——在一份当时的文件中称为"纽曼-威廉斯机器"(Huskey 1947)——的荣誉不仅属于威廉斯和基尔伯恩,也属于纽曼,而且图灵 1936 年论文对纽曼的影响至关重要,正如弗劳尔斯的巨人机的影响一样。

The first working AI program, a draughts (checkers) player written by Christopher Strachey, ran on the Ferranti Mark I in the Manchester Computing Machine Laboratory. Strachey (at the time a teacher at Harrow School and an amateur programmer) wrote the program with Turing’s encouragement and utilising the latter’s recently completed Programmers’ Handbook for the Ferranti. (Strachey later became Director of the Programming Research Group at Oxford University.) By the summer of 1952, the program could, Strachey reported, ‘play a complete game of draughts at a reasonable speed’. (Strachey’s program formed the basis for Arthur Samuel’s well-known checkers program.) The first chess-playing program, also, was written for the Manchester Ferranti, by Dietrich Prinz; the program first ran in November 1951. Designed for solving simple problems of the mate-in-two variety, the program would examine every possible move until a solution was found. Turing started to program his ‘Turochamp’ chess-player on the Ferranti Mark I, but never completed the task. Unlike Prinz’s program, the Turochamp could play a complete game (when hand-simulated) and operated not by exhaustive search but under the guidance of heuristics.
第一个可工作的人工智能程序,一个由克里斯托弗 · 斯特拉奇(Christopher Strachey)编写的跳棋程序,在曼彻斯特计算机器实验室的费兰蒂 Mark I 上运行。斯特拉奇(当时是哈罗学校的教师和业余程序员)在图灵的鼓励下编写了该程序,并利用了后者刚完成的费兰蒂编程手册。(斯特拉奇后来成为牛津大学编程研究组的主任。)到 1952 年夏天,据斯特拉奇报告,该程序"能以合理的速度下一整盘跳棋"。(斯特拉奇的程序构成了亚瑟 · 塞缪尔(Arthur Samuel)著名的跳棋程序的基础。)第一个国际象棋程序也是为曼彻斯特费兰蒂编写的,由迪特里希 · 普林茨(Dietrich Prinz)编写;该程序于 1951 年 11 月首次运行。该程序设计用于解决简单的两步将死问题,它会检查每一步可能的走法直到找到解决方案。图灵开始在费兰蒂 Mark I 上编程他的"Turochamp"国际象棋程序,但从未完成这项任务。与普林茨的程序不同,Turochamp 能下一整盘棋(当用手模拟时),并且不是通过穷举搜索,而是在启发式的指导下运行。

ENIAC and EDVAC

ENIAC 与 EDVAC

The first fully functioning electronic digital computer to be built in the U.S. was ENIAC, constructed at the Moore School of Electrical Engineering, University of Pennsylvania, for the Army Ordnance Department, by J. Presper Eckert and John Mauchly. Completed in 1945, ENIAC was somewhat similar to the earlier Colossus, but considerably larger and more flexible (although far from general-purpose). The primary function for which ENIAC was designed was the calculation of tables used in aiming artillery. ENIAC was not a stored-program computer, and setting it up for a new job involved reconfiguring the machine by means of plugs and switches. For many years, ENIAC was believed to have been the first functioning electronic digital computer, Colossus being unknown to all but a few.
美国建造的第一台完全可运行的电子数字计算机是 ENIAC,由 J. 普雷斯珀 · 埃克特(J. Presper Eckert)和约翰 · 莫奇利(John Mauchly)在宾夕法尼亚大学摩尔电气工程学院为陆军军械部建造。ENIAC 于 1945 年完成,与早期的巨人机有些相似,但规模大得多且更灵活(尽管远非通用)。ENIAC 设计的主要功能是计算用于瞄准火炮的表格。ENIAC 不是存储程序计算机,为新任务设置它需要重新配置机器的线路。多年来,ENIAC 被认为是第一台可运行的电子数字计算机,而巨人机除少数人外不为人知。

In 1944, John von Neumann joined the ENIAC group. He had become ‘intrigued’ (Goldstine’s word, [1972], p. 275) with Turing’s universal machine while Turing was at Princeton University during 1936–1938. At the Moore School, von Neumann emphasised the importance of the stored-program concept for electronic computing, including the possibility of allowing the machine to modify its own program in useful ways while running (for example, in order to control loops and branching). Turing’s paper of 1936 (‘On Computable Numbers, with an Application to the Entscheidungsproblem’) was required reading for members of von Neumann’s post-war computer project at the Institute for Advanced Study, Princeton University (letter from Julian Bigelow to Copeland, 2002; see also Copeland [2004], p. 23). Eckert appears to have realised independently, and prior to von Neumann’s joining the ENIAC group, that the way to take full advantage of the speed at which data is processed by electronic circuits is to place suitably encoded instructions for controlling the processing in the same high-speed storage devices that hold the data itself (documented in Copeland [2004], pp. 26–7). In 1945, while ENIAC was still under construction, von Neumann produced a draft report, mentioned previously, setting out the ENIAC group’s ideas for an electronic stored-program general-purpose digital computer, the EDVAC (von Neuman [1945]). The EDVAC was completed six years later, but not by its originators, who left the Moore School to build computers elsewhere. Lectures held at the Moore School in 1946 on the proposed EDVAC were widely attended and contributed greatly to the dissemination of the new ideas.
1944 年,约翰 · 冯 · 诺伊曼(John von Neumann)加入 ENIAC 小组。1936–1938 年图灵在普林斯顿大学期间,冯 · 诺伊曼对图灵的通用机产生了"兴趣"(戈德斯廷的用语,[1972],第 275 页)。在摩尔学院,冯 · 诺伊曼强调了存储程序概念对电子计算的重要性,包括允许机器在运行时以有用的方式修改自身程序的可能性(例如,为了控制循环和分支)。图灵 1936 年的论文(《论可计算数及其在判定问题上的应用》)是普林斯顿大学高等研究院冯 · 诺伊曼战后计算机项目成员的必读材料(Julian Bigelow 2002 年致 Copeland 的信;另见 Copeland [2004],第 23 页)。埃克特似乎在冯 · 诺伊曼加入 ENIAC 小组之前,就独立意识到,充分利用电子电路处理数据速度的方法,是将适当编码的控制处理指令放在与数据本身相同的高速存储设备中(记载于 Copeland [2004],第 26–7 页)。1945 年,在 ENIAC 仍在建造期间,冯 · 诺伊曼撰写了一份前述的报告初稿,阐述了 ENIAC 小组关于电子存储程序通用数字计算机 EDVAC 的想法(von Neuman [1945])。EDVAC 于六年后完成,但不是由其创始者完成的,他们离开摩尔学院去别处建造计算机。1946 年在摩尔学院举行的关于拟议 EDVAC 的讲座广受关注,为新思想的传播做出了巨大贡献。

Von Neumann was a prestigious figure and he made the concept of a high-speed stored-program digital computer widely known through his writings and public addresses. As a result of his high profile in the field, it became customary, although historically inappropriate, to refer to electronic stored-program digital computers as ‘von Neumann machines’.
冯 · 诺伊曼是一位享有声望的人物,他通过著作和公开演讲使高速存储程序数字计算机的概念广为人知。由于他在该领域的崇高地位,尽管在历史上并不恰当,但将电子存储程序数字计算机称为"冯 · 诺伊曼机"已成为惯例。

The Los Alamos physicist Stanley Frankel, responsible with von Neumann and others for mechanising the large-scale calculations involved in the design of the atomic bomb, has described von Neumann’s view of the importance of Turing’s 1936 paper, in a letter:
洛斯阿拉莫斯物理学家斯坦利 · 弗兰克尔(Stanley Frankel)与冯 · 诺伊曼等人共同负责将原子弹设计涉及的大规模计算机械化,他在一封信中描述了冯 · 诺伊曼对图灵 1936 年论文重要性的看法:

I know that in or about 1943 or '44 von Neumann was well aware of the fundamental importance of Turing’s paper of 1936 … Von Neumann introduced me to that paper and at his urging I studied it with care. Many people have acclaimed von Neumann as the “father of the computer” (in a modern sense of the term) but I am sure that he would never have made that mistake himself. He might well be called the midwife, perhaps, but he firmly emphasized to me, and to others I am sure, that the fundamental conception is owing to Turing, in so far as not anticipated by Babbage … Both Turing and von Neumann, of course, also made substantial contributions to the “reduction to practice” of these concepts but I would not regard these as comparable in importance with the introduction and explication of the concept of a computer able to store in its memory its program of activities and of modifying that program in the course of these activities. (Quoted in Randell [1972], p. 10)

“我知道在 1943 年或 1944 年左右,冯 · 诺伊曼充分意识到图灵 1936 年论文的根本重要性……冯 · 诺伊曼向我介绍了那篇论文,并在他的敦促下我仔细研究了它。许多人称赞冯 · 诺伊曼为"计算机之父”(就现代意义而言),但我确信他自己绝不会犯那个错误。他或许可以被称为助产士,但他坚定地向我和其他人强调,基本概念归功于图灵,就巴贝奇未预见到的程度而言……当然,图灵和冯 · 诺伊曼也都为这些概念的"付诸实践"做出了重大贡献,但我不认为这些与引入和阐释能够在其存储器中存储活动程序并在活动过程中修改该程序的计算机概念的重要性相当。"(引自 Randell [1972],第 10 页)

Other Notable Early Computers

其他早期著名计算机

Other notable early stored-program electronic digital computers were:

其他著名的早期存储程序电子数字计算机有:

  • EDSAC, 1949, built at Cambridge University by Maurice Wilkes
    EDSAC,1949 年,由莫里斯 · 威尔克斯(Maurice Wilkes)在剑桥大学建造
  • BINAC, 1949, built by Eckert’s and Mauchly’s Electronic Control Co., Philadelphia (opinions differ over whether BINAC ever actually worked)
    BINAC,1949 年,由埃克特和莫奇利的电子控制公司在费城建造(关于 BINAC 是否曾真正工作,意见不一)
  • Whirlwind I, 1949, Digital Computer Laboratory, Massachusetts Institute of Technology, Jay Forrester
    旋风 I 号(Whirlwind I),1949 年,麻省理工学院数字计算机实验室,杰伊 · 福雷斯特(Jay Forrester)
  • SEAC, 1950, US Bureau of Standards Eastern Division, Washington D.C., Samuel Alexander, Ralph Slutz
    SEAC,1950 年,美国标准局东部分局,华盛顿特区,塞缪尔 · 亚历山大(Samuel Alexander)、拉尔夫 · 斯拉茨(Ralph Slutz)
  • SWAC, 1950, US Bureau of Standards Western Division, Institute for Numerical Analysis, University of California at Los Angeles, Harry Huskey
    SWAC,1950 年,美国标准局西部分局,数值分析研究所,加州大学洛杉矶分校,哈里 · 哈斯基(Harry Huskey)
  • UNIVAC, 1951, Eckert-Mauchly Computer Corporation, Philadelphia (the first computer to be available commercially in the U.S.)
    UNIVAC,1951 年,埃克特-莫奇利计算机公司,费城(美国第一台商业可用计算机)
  • the IAS computer, 1952, Institute for Advanced Study, Princeton University, Julian Bigelow, Arthur Burks, Herman Goldstine, von Neumann, and others (thanks to von Neumann’s publishing the specifications of the IAS machine, it became the model for a group of computers known as the Princeton Class machines; the IAS computer was also a strong influence on the IBM 701)
    IAS 计算机,1952 年,普林斯顿大学高等研究院,朱利安 · 比奇洛(Julian Bigelow)、亚瑟 · 伯克斯(Arthur Burks)、赫尔曼 · 戈德斯廷(Herman Goldstine)、冯 · 诺伊曼等人(由于冯 · 诺伊曼发表了 IAS 机器的规格,它成为一组称为普林斯顿级机器的计算机的模型;IAS 计算机对 IBM 701 也有很大影响)
  • IBM 701, 1952, International Business Machine’s first mass-produced electronic stored-program computer.
    IBM 701,1952 年,国际商业机器公司第一台大规模生产的电子存储程序计算机。

High-Speed Memory

高速存储器

The EDVAC and ACE proposals both advocated the use of mercury-filled tubes, called ‘delay lines’, for high-speed internal memory. This form of memory is known as acoustic memory. Delay lines had initially been developed for echo cancellation in radar; the idea of using them as memory devices originated with Eckert at the Moore School. Here is Turing’s description:
EDVAC 和 ACE 的提案都提倡使用称为"延迟线"的充汞管作为高速内部存储器。这种存储器形式称为声学存储器。延迟线最初是为雷达中的回波消除而开发的;将它们用作存储设备的想法起源于摩尔学院的埃克特。以下是图灵的描述:

It is proposed to build “delay line” units consisting of mercury … tubes about 5′ long and 1″ in diameter in contact with a quartz crystal at each end. The velocity of sound in … mercury … is such that the delay will be 1.024 ms. The information to be stored may be considered to be a sequence of 1024 ‘digits’ (0 or 1) … These digits will be represented by a corresponding sequence of pulses. The digit 0 … will be represented by the absence of a pulse at the appropriate time, the digit 1 … by its presence. This series of pulses is impressed on the end of the line by one piezo-crystal, it is transmitted down the line in the form of supersonic waves, and is reconverted into a varying voltage by the crystal at the far end. This voltage is amplified sufficiently to give an output of the order of 10 volts peak to peak and is used to gate a standard pulse generated by the clock. This pulse may be again fed into the line by means of the transmitting crystal, or we may feed in some altogether different signal. We also have the possibility of leading the gated pulse to some other part of the calculator, if we have need of that information at the time. Making use of the information does not of course preclude keeping it also. (Turing [1945], p. 375)

“提议建造由汞……组成的"延迟线"单元,管子长约 5 英尺,直径约 1 英寸,两端各与一块石英晶体接触。……汞……中的声速使得延迟将为 1.024 毫秒。要存储的信息可视为 1024 个"数字”(0 或 1)的序列……这些数字将由相应的脉冲序列表示。数字 0……将由适当时间没有脉冲表示,数字 1……由其存在表示。这一脉冲序列由一块压电晶体施加于线路末端,以超声波形式沿线传输,并由远端的晶体重新转换为变化的电压。该电压被充分放大,以产生约 10 伏峰峰值的输出,并用于选通时钟产生的标准脉冲。该脉冲可通过发射晶体再次馈入线路,或我们可以馈入完全不同的信号。如果当时需要该信息,我们也有可能将选通脉冲引向计算器的其他部分。利用信息当然不排除同时保存它。"(Turing [1945],第 375 页)

Mercury delay line memory was used in EDSAC, BINAC, SEAC, Pilot Model ACE, EDVAC, DEUCE, and full-scale ACE (1958). The chief advantage of the delay line as a memory medium was, as Turing put it, that delay lines were “already a going concern” (Turing [1947], p. 380). The fundamental disadvantages of the delay line were that random access is impossible and, moreover, the time taken for an instruction, or number, to emerge from a delay line depends on where in the line it happens to be.
汞延迟线存储器用于 EDSAC、BINAC、SEAC、试点模型 ACE、EDVAC、DEUCE 和全规模 ACE(1958 年)。延迟线作为存储介质的主要优势,正如图灵所说,是延迟线"已经是现成的东西"(Turing [1947],第 380 页)。延迟线的根本缺点是不可能随机访问,而且指令或数字从延迟线中出来的时间取决于它碰巧在线路中的位置。

In order to minimize waiting-time, Turing arranged for instructions to be stored not in consecutive positions in the delay line, but in relative positions selected by the programmer in such a way that each instruction would emerge at exactly the time it was required, in so far as this was possible. Each instruction contained a specification of the location of the next. This system subsequently became known as ‘optimum coding’. It was an integral feature of every version of the ACE design. Optimum coding made for difficult and untidy programming, but the advantage in terms of speed was considerable. Thanks to optimum coding, the Pilot Model ACE was able to do a floating point multiplication in 3 milliseconds (Wilkes’s EDSAC required 4.5 milliseconds to perform a single fixed point multiplication).
为了最小化等待时间,图灵安排指令不存储在延迟线的连续位置中,而是由程序员选择相对位置,使得每条指令尽可能在需要时恰好出现。每条指令包含下一条指令位置的说明。这一系统后来被称为"最佳编码"。它是 ACE 设计每个版本的固有特征。最佳编码使编程变得困难且杂乱,但在速度方面的优势相当可观。得益于最佳编码,试点模型 ACE 能在 3 毫秒内完成一次浮点乘法(威尔克斯的 EDSAC 执行一次定点乘法需要 4.5 毫秒)。

In the Williams tube or electrostatic memory, previously mentioned, a two-dimensional rectangular array of binary digits was stored on the face of a commercially-available cathode ray tube. Access to data was immediate. Williams tube memories were employed in the Manchester series of machines, SWAC, the IAS computer, and the IBM 701, and a modified form of Williams tube in Whirlwind I (until replacement by magnetic core in 1953).
在前述的威廉斯管或静电存储器中,二维矩形二进制数字阵列存储在商业可用的阴极射线管表面上。数据访问是即时的。威廉斯管存储器用于曼彻斯特系列机器、SWAC、IAS 计算机和 IBM 701,旋风 I 号中使用了改进形式的威廉斯管(直到 1953 年被磁芯取代)。

Drum memories, in which data was stored magnetically on the surface of a metal cylinder, were developed on both sides of the Atlantic. The initial idea appears to have been Eckert’s. The drum provided reasonably large quantities of medium-speed memory and was used to supplement a high-speed acoustic or electrostatic memory. In 1949, the Manchester computer was successfully equipped with a drum memory; this was constructed by the Manchester engineers on the model of a drum developed by Andrew Booth at Birkbeck College, London.
磁鼓存储器——数据以磁性方式存储在金属圆柱体表面——在大西洋两岸都得到了发展。最初的想法似乎是埃克特的。磁鼓提供了相当大量的中速存储器,用于补充高速声学或静电存储器。1949 年,曼彻斯特计算机成功配备了磁鼓存储器;这是由曼彻斯特工程师按照伦敦伯克贝克学院安德鲁 · 布斯(Andrew Booth)开发的磁鼓模型建造的。

The final major event in the early history of electronic computation was the development of magnetic core memory. Jay Forrester realised that the hysteresis properties of magnetic core (normally used in transformers) lent themselves to the implementation of a three-dimensional solid array of randomly accessible storage points. In 1949, at Massachusetts Institute of Technology, he began to investigate this idea empirically. Forrester’s early experiments with metallic core soon led him to develop the superior ferrite core memory. Digital Equipment Corporation undertook to build a computer similar to the Whirlwind I as a test vehicle for a ferrite core memory. The Memory Test Computer was completed in 1953. (This computer was used in 1954 for the first simulations of neural networks, by Belmont Farley and Wesley Clark of MIT’s Lincoln Laboratory (see Copeland and Proudfoot [1996]).
电子计算早期历史的最后一个重大事件是磁芯存储器的发展。杰伊 · 福雷斯特意识到磁芯(通常用于变压器)的磁滞特性适合实现三维固体阵列的随机可访问存储点。1949 年,在麻省理工学院,他开始实证研究这一想法。福雷斯特早期对金属磁芯的实验很快使他开发出更优越的铁氧体磁芯存储器。数字设备公司(Digital Equipment Corporation)承担建造一台类似旋风 I 号的计算机,作为铁氧体磁芯存储器的测试载体。存储器测试计算机于 1953 年完成。(这台计算机于 1954 年被 MIT 林肯实验室的贝尔蒙特 · 法利(Belmont Farley)和韦斯利 · 克拉克(Wesley Clark)用于神经网络的首次模拟(见 Copeland and Proudfoot [1996])。

Once the absolute reliability, relative cheapness, high capacity and permanent life of ferrite core memory became apparent, core soon replaced other forms of high-speed memory. The IBM 704 and 705 computers (announced in May and October 1954, respectively) brought core memory into wide use.
一旦铁氧体磁芯存储器的绝对可靠性、相对廉价、高容量和永久寿命变得明显,磁芯很快取代了其他形式的高速存储器。IBM 704 和 705 计算机(分别于 1954 年 5 月和 10 月宣布)使磁芯存储器得到广泛使用。

Bibliography

参考文献

Works Cited

引用的著作

  • Babbage, C. (ed. by Campbell-Kelly, M.), 1994, Passages from the Life of a Philosopher, New Brunswick: Rutgers University Press
    Babbage, C.(Campbell-Kelly, M. 编),1994,《哲学家生平片段》(Passages from the Life of a Philosopher),新不伦瑞克:罗格斯大学出版社
  • Bennett, S., 1976, ‘F.C. Williams: his contribution to the development of automatic control’, National Archive for the History of Computing, University of Manchester, England. (This is a typescript based on interviews with Williams in 1976.)
    Bennett, S.,1976,“F.C. Williams:他对自动控制发展的贡献”,英国曼彻斯特大学计算历史国家档案馆。(这是基于 1976 年对威廉斯采访的打字稿。)
  • Bowker, G., and Giordano, R., 1993, ‘Interview with Tom Kilburn’, Annals of the History of Computing, 15: 17–32.
    Bowker, G. 和 Giordano, R.,1993,“汤姆 · 基尔伯恩访谈”,《计算历史年鉴》(Annals of the History of Computing),15:17–32。
  • Copeland, B.J. (ed.), 2004, The Essential Turing Oxford University Press
    Copeland, B.J.(编),2004,《图灵精粹》(The Essential Turing),牛津大学出版社
  • Copeland, B.J. (ed.), 2005, Alan Turing’s Automatic Computing Engine: The Master Codebreaker’s Struggle to Build the Modern Computer Oxford University Press
    Copeland, B.J.(编),2005,《艾伦 · 图灵的自动计算引擎:密码破译大师建造现代计算机的奋斗》(Alan Turing’s Automatic Computing Engine: The Master Codebreaker’s Struggle to Build the Modern Computer),牛津大学出版社
  • Copeland, B.J. and others, 2006, Colossus: The Secrets of Bletchley Park’s Codebreaking Computers Oxford University Press
    Copeland, B.J. 等,2006,《巨人机:布莱切利园密码破译计算机的秘密》(Colossus: The Secrets of Bletchley Park’s Codebreaking Computers),牛津大学出版社
  • Copeland, B.J., and Proudfoot, D., 1996, ‘On Alan Turing’s Anticipation of Connectionism’ Synthese, 108: 361–377
    Copeland, B.J. 和 Proudfoot, D.,1996,“论艾伦 · 图灵对联结主义的预见”,《综合》(Synthese),108:361–377
  • Evans, C., 197?, interview with M.H.A. Newman in ‘The Pioneers of Computing: an Oral History of Computing’, London: Science Museum
    Evans, C.,197?,“M.H.A. 纽曼访谈”,载于《计算的先驱:计算口述史》(“The Pioneers of Computing: an Oral History of Computing”),伦敦:科学博物馆
  • Fifer, S., 1961, Analog Computation: Theory, Techniques, Applications New York: McGraw-Hill
    Fifer, S.,1961,《模拟计算:理论、技术、应用》(Analog Computation: Theory, Techniques, Applications),纽约:麦格劳-希尔
  • Ford, H., 1919, ‘Mechanical Movement’, Official Gazette of the United States Patent Office, October 7, 1919: 48
    Ford, H.,1919,“机械运动”,《美国专利局官方公报》(Official Gazette of the United States Patent Office),1919 年 10 月 7 日:48
  • Goldstine, H., 1972, The Computer from Pascal to von Neumann Princeton University Press
    Goldstine, H.,1972,《从帕斯卡到冯 · 诺伊曼的计算机》(The Computer from Pascal to von Neumann),普林斯顿大学出版社
  • Huskey, H.D., 1947, ‘The State of the Art in Electronic Digital Computing in Britain and the United States’, in [Copeland 2005]
    Huskey, H.D.,1947,“英美电子数字计算的技术现状”,载于 [Copeland 2005]
  • Newman, M.H.A., 1948, ‘General Principles of the Design of All-Purpose Computing Machines’ Proceedings of the Royal Society of London, series A, 195 (1948): 271–274
    Newman, M.H.A.,1948,“通用计算机设计的普遍原则”,《伦敦皇家学会学报》,A 辑,195(1948):271–274
  • Randell, B., 1972, ‘On Alan Turing and the Origins of Digital Computers’, in Meltzer, B., Michie, D. (eds), Machine Intelligence 7, Edinburgh: Edinburgh University Press, 1972
    Randell, B.,1972,“论艾伦 · 图灵与数字计算机的起源”,载于 Meltzer, B.、Michie, D.(编),《机器智能 7》(Machine Intelligence 7),爱丁堡:爱丁堡大学出版社,1972 年
  • Smith, B.C., 1991, ‘The Owl and the Electric Encyclopaedia’, Artificial Intelligence, 47: 251–288
    Smith, B.C.,1991,“猫头鹰与电子百科全书”,《人工智能》(Artificial Intelligence),47:251–288
  • Thomson, J., 1876, ‘On an Integrating Machine Having a New Kinematic Principle’ Proceedings of the Royal Society of London, 24: 262–5
    Thomson, J.,1876,“论一种具有新运动学原理的积分机”,《伦敦皇家学会学报》,24:262–5
  • Turing, A.M., 1936, ‘On Computable Numbers, with an Application to the Entscheidungsproblem’ Proceedings of the London Mathematical Society, Series 2, 42 (1936–37): 230–265. Reprinted in The Essential Turing (Copeland [2004]).
  • Turing, A.M.,1936,“论可计算数及其在判定问题上的应用”,《伦敦数学会学报》,第 2 辑,42(1936–37):230–265。重印于《图灵精粹》(Copeland [2004])。
  • Turing, A.M, 1945, ‘Proposed Electronic Calculator’, in Alan Turing’s Automatic Computing Engine (Copeland [2005])
    Turing, A.M.,1945,“提议的电子计算器”,载于《艾伦 · 图灵的自动计算引擎》(Copeland [2005])
  • Turing, A.M., 1947, ‘Lecture on the Automatic Computing Engine’, in The Essential Turing (Copeland [2004])
  • Turing, A.M.,1947,“关于自动计算引擎的讲座”,载于《图灵精粹》(Copeland [2004])
    Turing, A.M., and Wilkinson, J.H., 1946–7, ‘The Turing-Wilkinson Lecture Series (1946-7)’, in Alan Turing’s Automatic Computing Engine (Copeland [2005])
    Turing, A.M. 和 Wilkinson, J.H.,1946–7,“图灵-威尔克斯系列讲座(1946-7)”,载于《艾伦 · 图灵的自动计算引擎》(Copeland [2005])
  • von Neumann, J., 1945, ‘First Draft of a Report on the EDVAC’, in Stern, N. From ENIAC to UNIVAC: An Appraisal of the Eckert-Mauchly Computers Bedford, Mass.: Digital Press (1981), pp. 181–246
    von Neumann, J.,1945,“关于 EDVAC 的报告初稿”,载于 Stern, N.《从 ENIAC 到 UNIVAC:埃克特-莫奇利计算机评估》(From ENIAC to UNIVAC: An Appraisal of the Eckert-Mauchly Computers),马萨诸塞州贝德福德:数字出版社(1981 年),第 181–246 页
  • Williams, F.C., 1975, ‘Early Computers at Manchester University’ The Radio and Electronic Engineer, 45 (1975): 237–331
    Williams, F.C.,1975,“曼彻斯特大学的早期计算机”,《无线电与电子工程师》(The Radio and Electronic Engineer),45(1975):237–331
  • Wynn-Williams, C.E., 1932, ‘A Thyratron “Scale of Two” Automatic Counter’ Proceedings of the Royal Society of London, series A, 136: 312–324
    Wynn-Williams, C.E.,1932,“闸流管’二进’自动计数器”,《伦敦皇家学会学报》,A 辑,136:312–324

Further Reading

延伸阅读

  • Copeland, B.J., 2004, ‘Colossus — Its Origins and Originators’ Annals of the History of Computing, 26: 38–45
    Copeland, B.J.,2004,“巨人机——其起源与创始人”,《计算历史年鉴》,26:38–45
  • Metropolis, N., Howlett, J., Rota, G.C. (eds), 1980, A History of Computing in the Twentieth Century New York: Academic Press
    Metropolis, N.、Howlett, J.、Rota, G.C.(编),1980,《二十世纪计算史》(A History of Computing in the Twentieth Century),纽约:学术出版社
  • Randell, B. (ed.), 1982, The Origins of Digital Computers: Selected Papers Berlin: Springer-Verlag
    Randell, B.(编),1982,《数字计算机的起源:论文选集》(The Origins of Digital Computers: Selected Papers),柏林:施普林格出版社
  • Williams, M.R., 1997, A History of Computing Technology Los Alamitos: IEEE Computer Society Press
    Williams, M.R.,1997,《计算技术史》(A History of Computing Technology),洛斯阿拉米托斯:IEEE 计算机学会出版社

via:

  • The Modern History of Computing (Spring 2007 Edition)
    https://plato.stanford.edu/archives/spr2007/entries/computing-history/

本文地址:https://www.yitenyun.com/5643.html

搜索文章

Tags

#语言模型 #服务器 #人工智能 #大模型 #ai #ai大模型 #agent #飞书 #python #pip #conda #微信 #log4j #ollama #AI #AI编程 #运维 #飞牛nas #fnos #ios面试 #ios弱网 #断点续传 #ios开发 #objective-c #ios #ios缓存 #学习 #产品经理 #AI大模型 #大模型学习 #大模型教程 #kylin #docker #arm #远程工作 #Trae #IDE #AI 原生集成开发环境 #Trae AI #私有化部署 #ssh #linux #云计算 #云原生 #mongodb #数据库 #算法 #数据结构 #PyTorch #深度学习 #模型训练 #星图GPU 香港站群服务器 多IP服务器 香港站群 站群服务器 #ARM服务器 # GLM-4.6V # 多模态推理 #kubernetes #笔记 #平面 #容器 #学习方法 #银河麒麟高级服务器操作系统安装 #银河麒麟高级服务器V11配置 #设置基础软件仓库时出错 #银河麒高级服务器系统的实操教程 #生产级部署银河麒麟服务系统教程 #Linux系统的快速上手教程 #fastapi #html #css #分布式 #架构 #配置中心 #SpringCloud #Apollo #大数据 #职场和发展 #程序员创富 #mysql #分库分表 #垂直分库 #水平分表 #雪花算法 #分布式ID #跨库查询 #自动化 #ansible #科技 #自然语言处理 #神经网络 #vscode #ubuntu #音视频 #github #信息与通信 #rpa #实时互动 #ide #java #开发语言 #前端 #javascript #gitee #pytorch #AIGC #开源 #华为云 #部署上线 #动静分离 #Nginx #新人首发 #数学建模 #大模型入门 #llama #opencv #hadoop #hbase #hive #zookeeper #spark #kafka #flink #低代码 #爬虫 #langchain #区块链 #测试用例 #生活 #node.js #gemini #gemini国内访问 #gemini api #gemini中转搭建 #Cloudflare #阿里云 #C++ #Reactor #http #mcp #mcp server #AI实战 #MobaXterm #物联网 #websocket #流程图 #论文阅读 #信息可视化 #大语言模型 #长文本处理 #GLM-4 #Triton推理 #CFD #notepad++ #机器学习 #sql #agi #pycharm #进程控制 #nginx #YOLO #spring boot #maven #spring #fabric #postgresql #openHiTLS #TLCP #DTLCP #密码学 #商用密码算法 #FRP #java-ee #网络 #项目 #高并发 #经验分享 #安卓 #tcp/ip #word #umeditor粘贴word #ueditor粘贴word #ueditor复制word #ueditor上传word图片 #aws #矩阵 #线性代数 #AI运算 #向量 #分阶段策略 #模型协议 #rag #Ansible # 自动化部署 # VibeThinker #Linux #TCP #c++ #线程 #线程池 #windows #iventoy #VmWare #OpenEuler #多个客户端访问 #IO多路复用 #回显服务器 #TCP相关API #git #harmonyos #华为 #驱动开发 #后端 #腾讯云 #重构 #计算机视觉 #企业微信 #AI办公 #智能助手 #Telegram机器人 #ClawdBot #多模态翻译 #大模型推理 #flutter #鸿蒙 #鸿蒙PC #SSM 框架 #孕期健康 #产品服务推荐 #推荐系统 #用户交互 #android #c# #qt #Agent #程序员 #web安全 #安全 #php #网络安全 #就业指南 #开源软件 #RAGFlow #DeepSeek-R1 #RAG #RAG调优 #RAG系统 #召回 #https #网络协议 #unity #游戏引擎 #RTP over RTSP #RTP over TCP #RTSP服务器 #RTP #TCP发送RTP #风控模型 #决策盲区 #mvp #个人开发 #设计模式 #vue上传解决方案 #vue断点续传 #vue分片上传下载 #vue分块上传下载 #性能优化 #dify #FaceFusion # Token调度 # 显存优化 #Conda # 私有索引 # 包管理 #课程设计 #数信院生信服务器 #Rstudio #生信入门 #生信云服务器 #cpolar #缓存 #redis #ci/cd #jenkins #gitlab #正则 #正则表达式 #rocketmq #硬件工程 #能源 #centos #stm32 #Harbor #microsoft #iBMC #UltraISO #Windows 更新 #HCIA-Datacom #H12-811 #题库 #最新题库 #进程 #FL Studio #FLStudio #FL Studio2025 #FL Studio2026 #FL Studio25 #FL Studio26 #水果软件 #电脑 #mobaxterm #le audio #蓝牙 #低功耗音频 #通信 #连接 #MCP #MCP服务器 #vue.js #springboot #毕业设计 #serverless #程序人生 #科研 #博士 #内存治理 #django #牛客周赛 #搜索引擎 #导航网 #超算服务器 #算力 #高性能计算 #仿真分析工作站 #lvs #负载均衡 #pjsip #servlet #散列表 #哈希算法 #企业开发 #ERP #项目实践 #.NET开发 #C#编程 #编程与数学 #文心一言 #AI智能体 #mcu #bytebase #svn #spring cloud #json #华为od #华为od机考真题 #华为od机试真题 #华为OD上机考试真题 #华为OD机试双机位C卷 #华为OD上机考试双机位C卷 #华为ODFLASH坏块监测系统 #堡垒机 #安恒明御堡垒机 #windterm #时序数据库 #jar #Canal #测试工具 #儿童书籍 #儿童诗歌 #童话故事 #经典好书 #儿童文学 #好书推荐 #经典文学作品 #c语言 #ai agent #ai大小模型 #小模型 #开源小模型 #8b模型 #国产大模型 #SOTA #vim #gcc #yum #论文 #毕设 #设备驱动 #芯片资料 #网卡 #jetty #ecmascript #elementui #scrapy #ESXi #知识图谱 #jvm #学习笔记 #jdk #内网穿透 #udp #PyCharm # 远程调试 # YOLOFuse #微服务 #Oauth2 #uni-app #小程序 #jmeter #功能测试 #软件测试 #自动化测试 #golang #数据结构与算法 #ui #团队开发 #墨刀 #figma #select #处理器模块 #现货库存 #价格优惠 #PM864AK01 #3BSE018161R1 #PLC #控制器模块 #shell #CPU利用率 #gitea #ESP32 #开发环境搭建 #FTP服务器 #游戏 #2026年美赛C题代码 #2026年美赛 #ssl #DeepSeek #服务器繁忙 #服务器架构 #AI推理芯片 #蓝桥杯 #转行 #es安装 #推荐算法 #prometheus #swiftui #swift #dubbo #线性回归 #嵌入式 #diskinfo # TensorFlow # 磁盘健康 #压枪 #边缘计算 #单片机 #嵌入式硬件 #电脑故障 #文件系统 #autosar #LLM #java大文件上传 #java大文件秒传 #java大文件上传下载 #java文件传输解决方案 #系统架构 #web #webdav #新浪微博 #前端框架 #matlab #支持向量机 #SSH # ProxyJump # 跳板机 #深度优先 #DFS #远程连接 #css3 #计算机网络 #vllm #我的世界 #游戏私服 #云服务器 #全能视频处理软件 #视频裁剪工具 #视频合并工具 #视频压缩工具 #视频字幕提取 #视频处理工具 #Dell #PowerEdge620 #内存 #硬盘 #RAID5 #Ubuntu服务器 #硬盘扩容 #命令行操作 #VMware #鸭科夫 #逃离鸭科夫 #鸭科夫联机 #鸭科夫异地联机 #开服 #职场发展 #PowerBI #企业 #ProCAST2025 #ProCast #脱模 #顶出 #应力计算 #铸造仿真 #变形计算 #链表 #openclaw #实在Agent #架构师 #软考 #系统架构师 #numpy #scikit-learn #matplotlib #FutureWarning #ddos #visual studio #社科数据 #数据分析 #数据挖掘 #数据统计 #经管数据 #ffmpeg #chatgpt #DS随心转 #创业创新 #钉钉 #机器人 #flask #零售 #wpf #3d #国企混改 #国企混改咨询 #国企混改战略规划 #GPU #曦望 #SSE #Android #Bluedroid #transformer #AI写作 #思维模型 #认知框架 #认知 #论文笔记 #分类 #LabVIEW #光谱仪 #串口通信 #AQ6370 #pdf #高仿永硕E盘的个人网盘系统源码 #压力测试 #Buck #NVIDIA #交错并联 #DGX #wsl #L2C #勒让德到切比雪夫 #游戏美术 #技术美术 #游戏策划 #游戏程序 #用户体验 #visual studio code #postman #easyui #lstm #健康医疗 #金融 #教育电商 #媒体 #prompt #车辆排放 #whisper #Redisson #googlecloud #虚幻 #ue5 #具身智能 #发展心理学 #运动控制 #内在动机 #镜像神经元 #交叉学科 #leetcode #macos #广播 #组播 #并发服务器 #防排烟监控 #消防风机一体化 #BA楼宇自控 #DDC控制器 #IBMS集成系统 #AI大模型应用开发 #电商 #汽车 #powerpoint #Com #ISP Pipeline #行缓冲 #stl #chrome #微信小程序 #react.js #CISSP #CISSP考点 #信息安全 #CISSP哪里考 #公众号:厦门微思网络 #+微信号:xmweisi #DisM++ # 系统维护 #目标检测 #pyqt #单目测距 #速度估计 #pyqt界面 #注意力机制 #cnn #开源社区 #国产基础软件 #操作系统 #AI框架 #Rust #gpu算力 #dreamweaver #OCR #文档识别 #DeepSeek-OCR-2 #信创适配 #laravel #xss #selenium #TRO #TRO侵权 #TRO和解 #labview #集成测试 #单元测试 #AI产品经理 #大模型开发 #mmap #nio #Java面试 #Java程序员 #后端开发 #Redis #分布式锁 #爱心代码 #表白代码 #爱心 #tkinter #情人节表白代码 #测评 #arm开发 #七年级上册数学 #有理数 #有理数的加法法则 #绝对值 #excel #海外服务器安装宝塔面板 #abtest #数列 #数学 #数论 #洛谷 #敏捷流程 #wps #面试 #Playbook #AI服务器 #自动驾驶 #echarts #无人机 #安全架构 #全栈 #漏洞 #数据安全 #注入漏洞 #IPMI #智慧校园一体化平台 #智慧校园管理系统 #合肥自友科技-智慧校园 #智慧校园源头厂家 #智慧校园软件供应商 #智慧校园平台服务商 #高性价比智慧校园系统 #多线程 #数组 #性能调优策略 #双锁实现细节 #动态分配节点内存 #阻塞队列 #生产者消费者模型 #服务器崩坏原因 #oracle #r-tree #测试覆盖率 #可用性测试 #智能体从0到1 #新手入门 #Moltbook #Clawdbot #信号处理 #目标跟踪 #Cpolar #国庆假期 #服务器告警 #图像分类 #图像分割 #yolo26算法 #其他 #SEO优化 #OBC #数字化转型 #实体经济 #中小企业 #商业模式 #软件开发 #青蓝送水模式 #创业干货 #svm #amdgpu #kfd #ROCm #Java #Spring #Spring Boot #twitter #内容运营 #产品运营 #中间件 #elasticsearch #版本控制 #Git入门 #开发工具 #代码托管 #企业级存储 #网络设备 #rpc #protobuf #三种参数 #参数的校验 #fastAPI #openresty #lua #YOLO26 #YOLO11 #计算机 #连锁药店 #连锁店 #肿瘤相关巨噬细胞 #CXCL5 #信号通路 #胃癌 #mTOR #乐备实 #labex #防毒口罩 #防尘口罩 #sglang #聚类 #CNAS #CMA #程序文件 #STL #string #笔试 #企业存储 #RustFS #对象存储 #高可用 #rust #逻辑回归 #list #智能路由器 #fastmcp #材料工程 #数码相机 #智能电视 #语义检索 #文本向量化 #GTE-Pro #企业AI #AI运维 #企业微信集成 #DevOps自动化 #pipeline #Transformers #NLP #酒店客房管理系统 #KMS 激活 #阳台种菜 #园艺手扎 #Gemini #Nano Banana Pro #sqlserver #数据仓库 #vnstat #监控 #状态模式 #Moltbot #结构体 #google #search #WT-2026-0001 #QVD-2026-4572 #smartermail #Modbus-TCP #asp.net #vue3 #天地图 #403 Forbidden #天地图403错误 #服务器403问题 #天地图API #部署报错 #考研 #软件工程 #京东云 #GB/T4857 #GB/T4857.17 #GB/T4857测试 #蓝耘智算 #bash #Streamlit #Qwen #本地部署 #AI聊天机器人 #数据集 #并发 #单例模式 #360AI图片精简版 #看图工具 #电脑看图工具 #360看图工具 #AI看图工具 #打卡 #计算机英语翻译 #制造 #bootstrap #社交智慧 #职场生存 #系统思维 #身体管理 #商务宴请 #拒绝油腻 #清醒日常 #mybatis #后端 #IndexTTS2 # 阿里云安骑士 # 木马查杀 #可信计算技术 #ssm #银河麒麟 #人大金仓 #Kingbase #语音识别 #幼儿园 #园长 #幼教 #JavaScript #余行补位 #意义对谈 #余行论 #领导者定义计划 #微PE #硬盘克隆 #DiskGenius #sql注入 #超算中心 #PBS #lsf #rabbitmq #Keycloak #Quarkus #AI编程需求分析 #epoll #带宽 #流量 #大带宽 #Deepseek #gpt-3 #wordpress #雨云 #若依 #quartz #框架 #麒麟 #国产化 #设计规范 #放大电路 #everything #LangGraph #系统安全 #SSH保活 #Miniconda #远程开发 #百度 #百度文库 #爱企查 #旋转验证码 #验证码识别 #图像识别 #流量运营 #用户运营 #智能手机 #react native #iphone #windows11 #系统修复 #eureka #tomcat #firefox #TURN # WebRTC # HiChatBox #同步WebServer服务器 #ESP32网页服务器 #轻量级http服务器 #ESP32物联网 #vue ##程序员和算法的浪漫 #文字检测 #.netcore #部署 # Triton # CUDA #clickhouse #DHCP #apache #贪心算法 #Tetrazine-Acid #1380500-92-4 #运营 #todesk #测试流程 #金融项目实战 #P2P #windbg分析蓝屏教程 #jupyter #启发式算法 #android-studio #android studio #android runtime #webrtc #ShaderGraph #图形 #2026AI元年 #年度趋势 #算法备案 #fpga开发 #跳槽 #业界资讯 #go #私域运营 #LangFlow #智能体 #投标 #标书制作 #源代码管理 #排序算法 #插入排序 #ai编程 #Chat平台 #ARM架构 #交互 #编辑器 #js逆向 #逆向 #混淆 #omv8 #树莓派 #nas #AI电商客服 #研发管理 #禅道 #禅道云端部署 #银河麒麟部署 #银河麒麟部署文档 #银河麒麟linux #银河麒麟linux部署教程 #winscp #5G #企业微信机器人 #本地大模型 #memcache #.net #数据采集 #汇编 #tensorflow #旅游推荐管理系统 #旅游攻略 #clawdbot #QQbot #QQ #网络攻击模型 #mariadb #spine #求职招聘 #自动化巡检 #RPA #影刀RPA #ipmitool #BMC #非标机械设计 #Smokeping #SQL #b/s架构 #移动学习平台 #数模美赛 #tcp/ip #智能路由器 #osg #守护进程 #复用 #screen #就业 #电气工程 #C# # IndexTTS 2.0 # 自动化运维 #全链路优化 #实战教程 #intellij-idea #database #idea #企业架构治理 #电力企业IT架构 #IT架构设计 #智能体来了 #SEO #Claude #命令模式 #Ubuntu #Steam #饥荒联机版 #SSH Agent Forwarding # PyTorch # 容器化 #homelab #Lattepanda #Jellyfin #Plex #Emby #Kodi #azure #OpenAI #故障 #优化 #双指针 #三维 #3D #三维重建 #考试系统 #在线考试 #培训考试 #考试练习 #CVE-2025-61686 #路径遍历高危漏洞 #需求分析 #梁辰兴 #传输连接管理 #计算机网络基础 #CSDN #流媒体 #NAS #飞牛NAS #NVR #EasyNVR #junit # GPU租赁 # 自建服务器 #长文本理解 #glm-4 #推理部署 # GLM-4.6V-Flash-WEB # AI部署 #语义搜索 #嵌入模型 #Qwen3 #AI推理 #MinIO服务器启动与配置详解 #AB包 #Tracker 服务器 #响应最快 #torrent 下载 #2026年 #Aria2 可用 #迅雷可用 #BT工具通用 #vuejs #vision pro #Puppet # IndexTTS2 # TTS #计算机现代史 #CUDA #Triton #nmodbus4类库使用教程 #一人公司 #独立开发者 #ZeroTermux #宝塔面板 #移动服务器 #Linux环境 #门禁 #读卡器 #梯控 #门禁一卡通 #门禁读卡器 #梯控读卡器 #IC卡读卡器 #未加引号服务路径 #MIMO #OFDM #技术原理 #通信算法 #运维开发 #gerrit #muduo #EventLoop #系统升级 #信创 #anaconda #虚拟环境 #RAID #磁盘 #系统管理 #服务 #sqlmap #平板 #交通物流 #智能硬件 #bond #服务器链路聚合 #网卡绑定 #IO # 高并发 #AI论文写作工具 #学术论文创作 #论文效率提升 #MBA论文写作 #muduo库 #claude #国产化OS #RSO #机器人操作系统 #glibc #SAM3 #CVE-2025-68143 #CVE-2025-68144 #CVE-2025-68145 #GPU服务器 #8U #硬件架构 #weston #x11 #x11显示服务器 #ONLYOFFICE #MCP 服务器 #Node.js #漏洞检测 #CVE-2025-27210 #HeyGem # 局域网访问 # 批量处理 #claude code #codex #code cli #ccusage #6G #太赫兹 #无线通信 #频谱 #无线 #PyTorch 特性 #动态计算图 #张量(Tensor) #自动求导Autograd #GPU 加速 #生态系统与社区支持 #与其他框架的对比 #SSH代理转发 # 双因素认证 #RAID技术 #存储 #copilot #CCE #Dify-LLM #Flexus #Ascend #MindIE #KMP #连接数据库报错 #银河麒麟操作系统 #openssh #华为交换机 #信创终端 #Docker # OTA升级 # 黄山派 #静脉曲张 #腿部健康 #mybatis #在线培训系统 #llm #防火墙 #1024程序员节 #web3.py #Tokio #异步编程 #系统编程 #Pin #http服务器 #统信UOS #搜狗输入法 #WIN32汇编 #TcpServer #accept #高并发服务器 #kmeans #RustDesk #IndexTTS 2.0 #本地化部署 #串口服务器 #工业级串口服务器 #串口转以太网 #串口设备联网通讯模块 #串口服务器选型 #math #homework #里氏替换原则 #pve #科普 #JT/T808 #车联网 #车载终端 #模拟器 #仿真器 #开发测试 #多进程 #python技巧 #mapreduce #paddleocr #生信 #uv #政务 #zotero #WebDAV #同步失败 #代理模式 #n8n #LE Audio #BAP #sizeof和strlen区别 #sizeof #strlen #计算数据类型字节数 #计算字符串长度 #可再生能源 #绿色算力 #风电 #gpt #漏洞挖掘 #Exchange #IT #技术 #儿童AI #图像生成 #提词器 #芦笋提词器 #risc-v #安全威胁分析 #东方仙盟 #仙盟创梦IDE #rustdesk #图书馆 #自习室 #Spring AI #AI Agent #开发者工具 #clamav #esp32 arduino #迁移重构 #代码迁移 #n8n解惑 #文生视频 #CogVideoX #AI部署 #kong #Kong Audio #Kong Audio3 #KongAudio3 #空音3 #空音 #中国民乐 #简单数论 #埃氏筛法 #计算机外设 #uvicorn #uvloop #asgi #event #行为模式分析 #数据 #应用层 #跨领域 #敏感信息 #yolov12 #研究生life #聊天小程序 #树莓派4b安装系统 #TCP服务器 #语音控制 #图像处理 #yolo #cursor #我的世界服务器搭建 #minecraft #TensorRT # 推理优化 #高品质会员管理系统 #收银系统 #同城配送 #最好用的电商系统 #最好用的系统 #推荐的前十系统 #JAVA PHP 小程序 #以太网温湿度气体多参量传感器 #以太网多合一传感器 #以太网环境监测终端 #可定制气体监测模组 #信令服务器 #Janus #MediaSoup #gpu #nvcc #cuda #nvidia #强化学习 #策略梯度 #REINFORCE #蒙特卡洛 #Llama-Factory # 大模型推理 #KMS激活 #模块 #建筑缺陷 #红外 #scala #synchronized #锁 #reentrantlock # 服务器IP # 端口7860 #JAVA #健身房预约系统 #健身房管理系统 #健身管理系统 #ThingsBoard MCP #戴尔服务器 #戴尔730 #装系统 # 服务器IP访问 # 端口映射 #高级IO #几何学 #拓扑学 #代理 #DooTask #openEuler #CANN #adb #UEFI #BIOS #Legacy BIOS #1panel #vmware #python学习路线 #python基础 #python进阶 #python标准库 #机器视觉 #6D位姿 #dba #mssql #ICPC #sqlite #硬件 #密码 #LoRA # RTX 3090 # lora-scripts #数字营销 #seo #paddlepaddle #fiddler #模型微调 #智能化测试 #质量效能 #skills #playwright #持续测试 #职业和发展 #r语言-4.2.1 #r语言 #语言 #ueditor导入word #ueditor导入pdf #dash #捷配 #pcb工艺 #opc ua #opc #泛型 #接口 #抽象类 #面向对象设计 #区间dp #二进制枚举 #图论 #ModelEngine #GNC #控制 #姿轨控 #markdown #建站 #支付 #GB28181 #SIP信令 #SpringBoot #视频监控 #debian #改行学it #Coze工作流 #AI Agent指挥官 #多智能体系统 #扩展屏应用开发 #eclipse #域名注册 #新媒体运营 #网站建设 #国外域名 #HBA卡 #RAID卡 #编程助手 #window10 #window11 #病毒 #DCOM进程 #系统进程资源占用高 #超时设置 #客户端/服务器 #网络编程 #IO编程 #ambari #nodejs #金融投资Agent #2026美国大学生数学建模 #2026美赛 #美赛ICM #美赛ICM Problem F #ICM赛题F #MATLAB #智慧城市 #旅游 #ida #MQTT协议 #春秋云境 #CVE-2020-5515 #C语言 #vivado license #数据可视化 #网路编程 #百万并发 #rtmp #hdfs #后端框架 #ROS #江协 #瑞萨 #OLED屏幕移植 #zabbix #集成学习 # 数字人系统 # 远程部署 #H5 #跨域 #发布上线后跨域报错 #请求接口跨域问题解决 #跨域请求代理配置 #request浏览器跨域 #STUN # TURN # NAT穿透 #隐私合规 #网络安全保险 #法律风险 #风险管理 #React #Next #CVE-2025-55182 #RSC #SSH免密登录 #CPU #spring native #远程访问 #远程办公 #飞网 #安全高效 #配置简单 #快递盒检测检测系统 #typescript #p2p #游戏机 #JumpServer #UDP的API使用 #容斥原理 #进程创建与终止 #hibernate #逆向工程 #blender #设计师 #ngrok #unity3d #服务器框架 #Fantasy #振镜 #振镜焊接 #公共MQTT服务器 # 黑屏模式 # TTS服务器 #web3 #claudeCode #content7 #pytest # 目标检测 #chat #xeon #文件IO #输入输出流 #麒麟OS #openvino #手机检测 #课堂手机检测 #galeweather.cn #高精度天气预报数据 #光伏功率预测 #风电功率预测 #高精度气象 #tcpdump #Modbus # 串口服务器 # NPort5630 #UDP套接字编程 #UDP协议 #网络测试 #SRS #直播 #OpenHarmony #milvus #知识库 #文本生成 #AI助手 #Python办公自动化 #Python办公 #STDIO协议 #Streamable-HTTP #McpTool注解 #服务器能力 #知识 #APM #AudioPolicy #音频策略 #iot #论文复现 #大模型应用 #API调用 #PyInstaller打包运行 #服务端部署 #反向代理 #智慧社区 #管理系统 #鼠大侠网络验证系统源码 #pencil #pencil.dev #设计 #Dify #轻量化 #低配服务器 #AI赋能盾构隧道巡检 #开启基建安全新篇章 #以注意力为核心 #YOLOv12 #AI隧道盾构场景 #盾构管壁缺陷病害异常检测预警 #隧道病害缺陷检测 #大模型面试 #Anything-LLM #IDC服务器 #工具集 #journalctl #Nacos #卷积神经网络 #参数估计 #矩估计 #概率论 #AI技术 #Kuikly #openharmony #LobeChat #vLLM #GPU加速 #LabVIEW知识 #LabVIEW程序 #LabVIEW功能 #鸿蒙系统 #车载系统 #MapGIS #云服务 #云门户 #IGServer #系统安装 #运动 #reactor反应堆 #xlwings #Excel #910B #openlayers #bmap #tile #server #flume #内存接口 # 澜起科技 # 服务器主板 #文件管理 #文件服务器 #SSH反向隧道 # Miniconda # Jupyter远程访问 # 显卡驱动备份 #虚拟机 #客户端 #DIY机器人工房 #零代码平台 #AI开发 #榛樿鍒嗙被 #mamba #监测 #nacos #银河麒麟aarch64 #Taiji #凤希AI伴侣 #esp32教程 #环境搭建 #scanf #printf #getchar #putchar #cin #cout #pandas #高考 #ipv6 #Spring源码 #Jetty # CosyVoice3 # 嵌入式服务器 #流量监控 #RXT4090显卡 #RTX4090 #深度学习服务器 #硬件选型 #轻量大模型 #C₃₂H₄₅N₇O₁₁S₂ #ue4 #DedicatedServer #独立服务器 #专用服务器 #MC # 公钥认证 #空间计算 #原型模式 #sentinel #Cesium #交互设计 #智能避障 #链表的销毁 #链表的排序 #链表倒置 #判断链表是否有环 #黑客技术 #挖漏洞 #日志分析 #SSH复用 # 远程开发 #多接口并发 #首页优化 #自动化运维 #智能家居 #cocoa #I/O #Lenyiin #EMC存储 #存储维护 #NetApp存储 #grafana #embedding #人脸识别 #人脸核身 #活体检测 #身份认证与人脸对比 #微信公众号 #GATT服务器 #蓝牙低功耗 #deepseek #eBPF #SSH公钥认证 # 安全加固 #ip #Fun-ASR # 语音识别 # WebUI #cpp #昇腾300I DUO #docker-compose #html5 #智慧校园解决方案 #智慧校园选型 #智慧校园采购 #智慧校园软件 #智慧校园专项资金 #智慧校园定制开发 #模型上下文协议 #MultiServerMCPC #load_mcp_tools #load_mcp_prompt #unix #asp.net大文件上传 #asp.net大文件上传下载 #asp.net大文件上传源码 #ASP.NET断点续传 #asp.net上传文件夹 #SSH别名 #IFix #http头信息 #vp9 #ping通服务器 #读不了内网数据库 #bug菌问答团队 #AutoDL ##租显卡 # 远程访问 # 服务器IP配置 #screen 命令 #创业管理 #财务管理 #团队协作 #创始人必修课 #数字化决策 #经营管理 # GLM-TTS # 数据安全 #xshell #host key #Kylin-Server #国产操作系统 #服务器安装 #软件构建 #Android16 #音频性能实战 #音频进阶 #黑群晖 #无U盘 #纯小白 #指针 #LVDS #高速ADC #DDR #Gunicorn #WSGI #Flask #并发模型 #容器化 #Python #性能调优 #wireshark #蓝湖 #Axure原型发布 #H5网页 #网页白屏 #H5页面空白 #资源加载问题 #打包部署后网页打不开 #HBuilderX #收银台开源 #收银台接口 #商业开源 #挖矿 #Linux病毒 #K8s #镜像 #集群自动化 #题解 #图 #dijkstra #迪杰斯特拉 #VS Code调试配置 #Deepoc #具身模型 #开发板 #未来 #ceph #mvc #实时检测 #tdengine #涛思数据 #SAP #ebs #metaerp #oracle ebs #AI-native #海外短剧 #海外短剧app开发 #海外短剧系统开发 #短剧APP #短剧APP开发 #短剧系统开发 #海外短剧项目 #comfyui #昇腾 #SSH跳转 #ajax #练习 #基础练习 #循环 #九九乘法表 #计算机实现 #编程语言 #powerbi #工厂模式 #Proxmox VE #虚拟化 #框架搭建 #WinDbg #Windows调试 #内存转储分析 #mtgsig #美团医药 #美团医药mtgsig #美团医药mtgsig1.2 #Anaconda配置云虚拟环境 #spring ai #oauth2 #log #Socket #套接字 #I/O多路复用 #字节序 #NPU #计算几何 #斜率 #方向归一化 #叉积 #夏天云 #夏天云数据 #浏览器自动化 #python #cascadeur #大剑师 #nodejs面试题 #铬锐特 #uv胶 #紫外线胶水 #光固化胶水 #胶粘剂 #C2000 #TI #实时控制MCU #AI服务器电源 #经济学 # 树莓派 # ARM架构 #智能一卡通 #梯控一卡通 #电梯一卡通 #消费一卡通 #一卡通 #考勤一卡通 #远程桌面 #远程控制 #内网 #浏览器指纹 #DNS #Discord机器人 #云部署 #程序那些事 #分布式数据库 #集中式数据库 #业务需求 #选型误 #RK3576 #瑞芯微 #硬件设计 #运维工具 #YOLOFuse # Base64编码 # 多模态检测 #领域驱动 #雨云服务器 #Minecraft服务器 #教程 #MCSM面板 #网络配置实战 #Web/FTP 服务访问 #计算机网络实验 #外网访问内网服务器 #Cisco 路由器配置 #静态端口映射 #网络运维 #一周会议与活动 #ICLR #CCF #SPA #单页应用 #工作 #水性三防漆 #UV三防漆 #有机硅三防漆 #聚氨酯三防漆 #醇酸树脂三防漆 #丙烯酸三防漆 #gRPC #注册中心 #服务器IO模型 #非阻塞轮询模型 #多任务并发模型 #异步信号模型 #多路复用模型 #AutoDL使用教程 #AI大模型训练 #linux常用命令 #PaddleOCR训练 #edge #迭代器模式 #观察者模式 #入侵 #日志排查 #算法笔记 # 服务器配置 # GPU #swagger #OSS #CDN #最佳实践 #贴图 #材质 #模板和元编程 #cpu #策略模式 #汇智网盘系统 #企业级云存储 #智能协作 #WinSCP 下载安装教程 #SFTP #FTP工具 #服务器文件传输 #CLI #langgraph.json #GESP4级 #GESP四级 #sort #滑动窗口 #字符串 #个人博客 # 键鼠锁定 #agentic bi #娱乐 #计算机毕业设计 #程序定制 #毕设代做 #大作业 #课设 #Java生成PDF #Freemarker转PDF #PDFBox转图片 #HTML转PDF乱码解决 #手机h5网页浏览器 #安卓app #苹果ios APP #手机电脑开启摄像头并排查 #音乐分类 #音频分析 #ViT模型 #Gradio应用 #嵌入式编译 #ccache #distcc #cocos2d #图形渲染 #数据迁移 #欧拉 #测速 #iperf #iperf3 #学术生涯规划 #CCF目录 #基金申请 #职称评定 #论文发表 #科研评价 #顶会顶刊 #ARM64 # DDColor # ComfyUI #usb #通信协议 #ocr #lprnet #车牌识别 #crnn #车牌检测 #puppeteer #生产服务器问题查询 #日志过滤 # 水冷服务器 # 风冷服务器 #VoxCPM-1.5-TTS # 云端GPU # PyCharm宕机 #rdp #人脸识别sdk #视频编解码 #AI生成 # outputs目录 # 自动化 #GLM-4.6V-Flash-WEB # AI视觉 # 本地部署 #翻译 #开源工具 #Fluentd #Sonic #日志采集 #dlms #dlms协议 #逻辑设备 #逻辑设置间权限 #视频去字幕 #libosinfo #外卖配送 #elk #决策树 #HistoryServer #Spark #YARN #jobhistory #大模型部署 #mindie #ComfyUI # 推理服务器 #restful #nfs #iscsi #YOLOv8 # Docker镜像 #模拟退火算法 #Hadoop #UDP #Karalon #AI Test #remote-ssh #SA-PEKS # 关键词猜测攻击 # 盲签名 # 限速机制 #模版 #函数 #类 #文件传输 #电脑文件传输 #电脑传输文件 #电脑怎么传输文件到另一台电脑 #电脑传输文件到另一台电脑 #性能 #RAM #CMake #Make #C/C++ #rtsp #转发 #工程实践 #WEB #群晖 #音乐 #IntelliJ IDEA # 高并发部署 #neo4j #NoSQL #vps #排序 #vrrp #脑裂 #keepalived主备 #高可用主备都持有VIP #SMP(软件制作平台) #EOM(企业经营模型) #应用系统 #软件需求 # 代理转发 #idm #simulink #寄存器 #aiohttp #asyncio #异步 #邮箱 #postfix #dovecot #LED #设备树 #GPIO #软件 #本地生活 #电商系统 #商城 #项目申报系统 #项目申报管理 #项目申报 #企业项目申报 #web服务器 #webpack #学术写作辅助 #论文创作效率提升 #AI写论文实测 #VibeVoice # 语音合成 # 云服务器 #遛狗 #proc #Aluminium #Google #I/O模型 #水平触发、边缘触发 #多路复用 #学工管理系统 #学工一体化平台 #学工软件二次开发 #学工平台定制开发 #学工系统服务商 #学工系统源头厂家 #智慧校园学工系统 #数据访问 #北京百思可瑞教育 #百思可瑞教育 #北京百思教育 #Shiro #反序列化漏洞 #CVE-2016-4437 #二值化 #Canny边缘检测 #轮廓检测 #透视变换 #arm64 #m3u8 #HLS #移动端H5网页 #APP安卓苹果ios #监控画面 直播视频流 #MOXA #Highcharts #插件封装 #ms-swift # 一锤定音 # 大模型微调 #React安全 #漏洞分析 #Next.js #UOS #海光K100 #统信 #联机教程 #局域网联机 #局域网联机教程 #局域网游戏 #safari #x-cmd #doubao #kimi #zhipu #claude-code #摩尔线程 #视觉检测 #npm #VPS #搭建 #高精度农业气象 #土地承包延包 #领码SPARK #aPaaS+iPaaS #智能审核 #档案数字化 #webgl #Qwen3-14B # 大模型部署 # 私有化AI #turn #ICE #信创国产化 #达梦数据库 #CPU推理 # 远程连接 #c++20 #国产PLM #瑞华丽PLM #瑞华丽 #PLM #网站 #截图工具 #批量处理图片 #图片格式转换 #图片裁剪 #攻防演练 #Java web #红队 #温湿度监控 #WhatsApp通知 #IoT #MySQL #MS #Materials # 环境迁移 #可撤销IBE #服务器辅助 #私钥更新 #安全性证明 #双线性Diffie-Hellman #API限流 # 频率限制 # 令牌桶算法 #TTS私有化 # IndexTTS # 音色克隆 #OWASP #juice-shop #安全漏洞练习靶场 #GitPuk #国产开源免费代码管理工具 #Arbess #cicd工具 #一文上手 #SMTP # 内容安全 # Qwen3Guard #X11转发 #视频 #回归 #动态规划 #时间复杂度 #空间复杂度 #前端界面 # AI翻译机 # 实时翻译 #DDD #tdd #智能梯控 #渗透测试 #网安应急响应 #FHSS #管道Pipe #system V #心理健康服务平台 #心理健康系统 #心理服务平台 #心理健康小程序 # 远程运维 #插件 #uvx #uv pip #npx #Ruff #HTML #web前端 #网页开发 #面试宝典 #TFTP #性能测试 #LoadRunner #N8N #华为机试 #TTS #SQL调优 #EXPLAIN #慢查询日志 #分布式架构 #dynadot #域名 # GPU集群 #HarmonyOS APP #esb接口 #走处理类报异常 #晶振 #随机森林 #西门子 #汇川 #Blazor #连锁门店核销 #美团团购券核销 #美团核销api #saas平台美团核销 #java接入美团团购 #EtherCAT #XMC4800 #工业自动化 #zygote #应用进程 #smtp #smtp服务器 #PHP #intellij idea #samba # 批量管理 #OpenManage #AI视频创作系统 #AI视频创作 #AI创作系统 #AI视频生成 #AI工具 #AI创作工具 #证书 #fs7TF #华为od机试 #华为od机考 #华为od最新上机考试题库 #华为OD题库 #od机考题库 #AI+ #coze #AI入门 #AI赋能 #计组 #数电 #cosmic #运维 #MCP服务器注解 #异步支持 #方法筛选 #声明式编程 #自动筛选机制 #Python3.11 #AI 推理 #NV #鲲鹏 #npu #JNI #上下文工程 #langgraph #意图识别 #ansys #ansys问题解决办法 # 网络延迟 #ranger #MySQL8.0 #服务器操作系统 #win10 #qemu #远程软件 #处理器 #笔记本电脑 #vertx #vert.x #vertx4 #runOnContext #传感器 #MicroPython # Connection refused #WRF #WRFDA #teamviewer #HarmonyOS #rsync # 数据同步 #C #CosyVoice3 # IP配置 # 0.0.0.0 #Apple AI #Apple 人工智能 #FoundationModel #Summarize #SwiftUI #移动端h5网页 #调用浏览器摄像头并拍照 #开启摄像头权限 #拍照后查看与上传服务器端 #摄像头黑屏打不开问题 #Socket网络编程 #机器人学习 #架构设计 #路由器 #istio #服务发现 #gateway ##python学习笔记 #python中with语句详解 #视觉理解 #Moondream2 #多模态AI #web server #请求处理流程 #勒索病毒 #勒索软件 #加密算法 #.bixi勒索病毒 #数据加密 #OPCUA #CA证书 #YOLO识别 #YOLO环境搭建Windows #YOLO环境搭建Ubuntu #主板 #电源 # 轻量化镜像 # 边缘计算 #青少年编程 # 大模型 # 模型训练 #租显卡 #训练推理 #工程设计 #预混 #扩散 #燃烧知识 #层流 #湍流 #Host #SSRF # 批量部署 #星际航行 #opc模拟服务器 #ArkUI #ArkTS #鸿蒙开发 #raid #raid阵列 #服务器线程 # SSL通信 # 动态结构体 #报表制作 #职场 #用数据讲故事 #语音生成 #bigtop #hdp #hue #kerberos # ms-swift #个人助理 #数字员工 #Langchain-Chatchat # 国产化服务器 # 信创 #节日 #ESP32编译服务器 #Ping #DNS域名解析 #麦克风权限 #访问麦克风并录制音频 #麦克风录制音频后在线播放 #用户拒绝访问麦克风权限怎么办 #uniapp 安卓 苹果ios #将音频保存本地或上传服务器 #moltbot #Syslog #系统日志 #日志监控 #Autodl私有云 #深度服务器配置 #KMS #slmgr #宝塔面板部署RustDesk #RustDesk远程控制手机 #手机远程控制 #铁路桥梁 #DIC技术 #箱梁试验 #裂纹监测 #四点弯曲 #电路仿真 #proteus #AD #keil #硬件工程师面试 #游戏服务器断线 # keep-alive #源码 #闲置物品交易系统 #期刊 #SCI #漏洞修复 #IIS Crypto #地理 #遥感 #IPv6 #面向对象 #taro #AI应用编程 #标准化事件委托 #工序流程工艺路径 #业务流程标准化 # REST API #全文检索 #Minecraft #PaperMC #我的世界服务器 #前端开发 #EN4FE #ZooKeeper #ZooKeeper面试题 #深入解析 #api #key #AI作画 #自由表达演说平台 #演说 #国产开源制品管理工具 #Hadess #范式 #x86_64 #数字人系统 #ET模式 #非阻塞 # 服务器迁移 # 回滚方案 #glances #开关电源 #热敏电阻 #PTC热敏电阻 #格式工厂 #Coturn #V11 #kylinos # 硬件配置 #算力一体机 #ai算力服务器 #API #阿里云RDS #万悟 #联通元景 #coffeescript #SMARC #ARM #tornado #H3C # 智能运维 # 性能瓶颈分析 #程序设计 #传统行业 #devops #gpio #攻击溯源 #编程 #warp #reactjs #Comate #bug #数智红包 #商业变革 #Zabbix #语音合成 #tekton #FASTMCP #因果学习 #磁盘配额 #存储管理 #形考作业 #国家开放大学 #系统运维 #C++ UA Server #SDK #Windows #跨平台开发 #网络 #Go并发 #高并发架构 #Goroutine #系统设计 #net core #kestrel #web-server #asp.net-core #SIP服务器 #语音服务器 #VoIP #SIP协议 #交换机 #三层交换机 #高斯溅射 #lucene #seata #TC/TM/RM #vlookup # ControlMaster #说话人验证 #声纹识别 #CAM++ #云开发 #AI智能棋盘 #Rock Pi S #MC群组服务器 #b树 #BoringSSL #memory mcp #Cursor #云计算运维 #直流无刷电机 #六步换相 #asp.net上传大文件 #PTP_1588 #gPTP #农产品物流管理 #物流管理系统 #农产品物流系统 #农产品物流 #Cubase #Cubase15 #Cubase14 #Cubase12 #Cubase13 #Cubase 15 Pro #Cubase 14 Pro #c++高并发 #CS2 #debian13 # ARM服务器 # 鲲鹏 #4U8卡 AI 服务器 ##AI 服务器选型指南 #GPU 互联 #GPU算力 #VSCode # SSH #uip #k8s #进程等待 #wait #waitpid #奈飞工厂算法挑战赛 # 离线AI #开发实战 #贝叶斯优化深度学习 #银河麒麟服务器系统 #短剧 #短剧小程序 #短剧系统 #微剧 #nosql #结构与算法 #文件上传漏洞 #SSH跳板机 # Python3.11 #大学生 #RGFNet多模态目标检测 #可见光-红外图像融合目标检测 #TGRS 2025顶刊论文 #YOLO多模态创新改进 #YOLO多模态融合属于发文热点 #CTF #screen命令 #TLS协议 #HTTPS #运维安全 #系统故障 #硬盘修复 #idc #esp32 #mosquito # GLM # 服务连通性 #unitask # GPU服务器 # tmux #程序开发 #服务器解析漏洞 #云服务器选购 #Saas #数据恢复 #视频恢复 #视频修复 #RAID5恢复 #流媒体服务器恢复 #NFC #智能公交 #服务器计费 #FP-增长 #outlook #错误代码2603 #无网络连接 #2603 #效率神器 #办公技巧 #自动化工具 #Windows技巧 #打工人必备 #SSH密钥 #数字孪生 #三维可视化 # Qwen3Guard-Gen-8B #ETL管道 #向量存储 #数据预处理 #DocumentReader #Gateway #认证服务器集成详解 #服务器开启 TLS v1.2 #IISCrypto 使用教程 #TLS 协议配置 #IIS 安全设置 #服务器运维工具 #uniapp #合法域名校验出错 #服务器域名配置不生效 #request域名配置 #已经配置好了但还是报错 #uniapp微信小程序 #ASR #SenseVoice #声源定位 #MUSIC #can #resnet50 #分类识别训练 #Xshell #Finalshell #生物信息学 #组学 #Spire.Office #ServBay #pxe #free #vmstat #sar #MinIO #智能体对传统行业冲击 #行业转型 #代理服务器 #Matrox MIL #二次开发 #嵌入式开发 # DIY主机 # 交叉编译 #STDIO传输 #SSE传输 #WebMVC #WebFlux #0day漏洞 #DDoS攻击 #漏洞排查 #懒汉式 #恶汉式 #odoo #win11 #c #appche #实时音视频 #Zernike #hcipy #光学设计 #像差仿真 #SEW #赛威 #SEW变频器 #ftp #sftp #CS336 #Assignment #Experiments #TinyStories #Ablation #Spring AOP #量子计算 #RWK35xx #语音流 #实时传输 #node #AE #PN 结 #ARMv8 #内存模型 #内存屏障 #js #AITechLab #cpp-python #CUDA版本 #docker安装seata #canvas层级太高 #canvas遮挡问题 #盖住其他元素 #苹果ios手机 #安卓手机 #调整画布层级 #express #cherry studio #gmssh #宝塔 #EDCA OS #可控AI #基础语法 #标识符 #常量与变量 #数据类型 #运算符与表达式 #POC #问答 #交付 #安全性测试 #Linly-Talker # 数字人 # 服务器稳定性 #总体设计 #电源树 #框图 #Archcraft #边缘AI # Kontron # SMARC-sAMX8 #okhttp #向量嵌入 #程序员转型 #人脸活体检测 #live-pusher #动作引导 #张嘴眨眼摇头 #苹果ios安卓完美兼容 #gnu #小艺 #搜索 #动画 #多模态 #微调 #超参 #LLamafactory #RTSP #Live555 #流媒体服务器 #毕设定制 #duckdb #AI应用 #测试网 #erc-20 #独立链 #polkadot #Linux多线程 #SQL注入主机 #cesium #可视化 #海量数据存储 #poll #熵权法 #灰色关联分析 #信息收集 #AI教材写作工具 #AI创作技术 #教材编写实战 #创作效率优化 # 模型微调 #昭和仙君 #VMware创建虚拟机 #防毒面罩 #防尘面罩 #数据库架构 #Qwen3-VL # 服务状态监控 # 视觉语言模型 #传媒 #隐函数 #常微分方程 #偏微分方程 #线性微分方程 #线性方程组 #非线性方程组 #复变函数 #身体实验室 #健康认知重构 #微行动 #NEAT效应 #亚健康自救 #ICT人 #个人电脑 #UDP服务器 #recvfrom函数 #灌封胶 #有机硅灌封胶 #聚氨酯灌封胶 #环氧树脂灌封胶 #电子灌封胶 #递归 #线性dp #Termux #Samba #Ward #音诺ai翻译机 #AI翻译机 # Ampere Altra Max #sklearn # 权限修复 #WAN2.2 #IPMB #远程管理 #日志模块 #VMware Workstation16 #大模型呼叫 #外呼系统 #AI外呼 #外呼系统推荐 #智能客服 #外呼 #pygame #xml #VMWare Tool #A2A #GenAI #持续部署 #网络安全大赛 #DAG #NSP #下一状态预测 #aigc #llvm #算力建设 #智能制造 #供应链管理 #工业工程 #库存管理 #RK3588 #RK3588J #评估板 #核心板 # 高温监控 #batch #springboot3 #springboot3升级 #Spring Batch #升级Spring Batch #AI工具集成 #容器化部署 #2025年 #CMC #AI教程 #RS232 #RS485 #RS422 #基金 #股票 #智能合约 #ossinsight #车载嵌入式 #SQL注入 #WAF绕过 #adobe # child_process #分子动力学 #化工仿真 #小智 #session #JADX-AI 插件 #解释器模式 #boltbot #RIP #结构体与联合体 #电子电气架构 #系统工程与系统架构的内涵 #Routine #starrocks #L6 #L10 #L9 #千问 #Beidou #北斗 #SSR #composer #symfony #java-zookeeper #Unity #游戏服务器 #AI零代码开发 #敏捷开发 #自然语言编程 #软件开发范式变革 #信奥赛 #提高组 #csp-s #初赛 #真题 #个性化推荐 #BERT模型 #AirDrop #远程更新 #缓存更新 #多指令适配 #物料关联计划 #Prometheus #思爱普 #SAP S/4HANA #ABAP #NetWeaver #统信操作系统 #人形机器人 #人机交互 #电梯 #电梯运力 #电梯门禁 #vncdotool #链接VNC服务器 #如何隐藏光标 #boosting #数据报系统 #保姆级教程 #电机正反转 #TMC2240 #DIR引脚控制 #英语学习 #jquery #fork函数 #进程创建 #进程终止 #二维数组 #DuckDB #协议 #爬虫实战 #零基础python爬虫教学 #双色球历史开奖数据 #期号红球篮球开奖日期等 #结构化CSV存储 #FunASR #语音转文字 #Arduino BLDC #核辐射区域探测机器人 #大数据分析