Biblical Scholars have long been intrigued by the chronology of the Book of Genesis. Most scholars today agree that the unnaturally large ages mentioned do not represent literal numbers. Professor E. A. Speiser 1 suggested, regarding the literalness of the numbers in Genesis, that One can see at a glance that the Masoretic [received] text is transparently schematic. 1 J. Skinner explains the differences between the Biblical versions as follows: These differences [in chronology, between the Masoretic text, the Septuagint and the Samaritan Torah] are certainly not accidental. They are due to carefully constructed artificial systems of chronology.... That problem has never been satisfactorily solved. 2 A search of the literature** did not turn up a satisfactory schematic arrangement; It can be seen that the life-spans are arranged in a pattern such that while the left term decreases by two, the squared term increases by one. This suggested that perhaps the chronologies in Genesis could be arranged into a scheme of factors not dissimilar to this one. Our first problem was to look for additional examples of this kind, taking into account the 64 different numbers in Genesis.
长期以来，圣经学者一直对《创世纪》的年表很感兴趣。今天大多数学者都同意，提到的非自然的大年龄并不代表字面上的数字。E. a . Speiser教授认为，关于《创世纪》中数字的字面意义，人们一眼就能看出，马所拉文本显然是一个示意图。1 J.斯金纳这样解释圣经版本之间的差异:这些差异(在年表上，马所拉文本、七十士译本和撒玛利亚Torah)当然不是偶然的。它们是由于精心构建的人工年表系统....那个问题从来没有得到满意的解决。查阅文献**没有找到令人满意的原理图排列;可以看出，寿命是这样排列的:左边的项减少2，平方项增加1。这表明，也许《创世纪》中的年表可以被安排成一个与这个没有什么不同的因素方案。我们的第一个问题是，考虑到创世纪中64个不同的数字，寻找其他类似的例子。
{"title":"A computer analysis of chronologies in Genesis","authors":"David E. Y. Sarna","doi":"10.1145/800196.806000","DOIUrl":"https://doi.org/10.1145/800196.806000","url":null,"abstract":"Biblical Scholars have long been intrigued by the chronology of the Book of Genesis. Most scholars today agree that the unnaturally large ages mentioned do not represent literal numbers. Professor E. A. Speiser 1 suggested, regarding the literalness of the numbers in Genesis, that One can see at a glance that the Masoretic [received] text is transparently schematic. 1 J. Skinner explains the differences between the Biblical versions as follows: These differences [in chronology, between the Masoretic text, the Septuagint and the Samaritan Torah] are certainly not accidental. They are due to carefully constructed artificial systems of chronology.... That problem has never been satisfactorily solved. 2 A search of the literature** did not turn up a satisfactory schematic arrangement; It can be seen that the life-spans are arranged in a pattern such that while the left term decreases by two, the squared term increases by one. This suggested that perhaps the chronologies in Genesis could be arranged into a scheme of factors not dissimilar to this one. Our first problem was to look for additional examples of this kind, taking into account the 64 different numbers in Genesis.","PeriodicalId":257203,"journal":{"name":"Proceedings of the 1967 22nd national conference","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1967-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129000313","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Anyone familiar with the theory of computability will be aware that practical conclusions from the theory must be drawn with caution. If a problem can theoretically be solved by computation, this does not mean that it is practical to do so. Conversely, if a problem is formally undecidable, this does not mean that the subcases of primary interest are impervious to solution by algorithmic methods. In the next section we describe such a class of programs, called “Loop programs.” Each Loop program consists only of assignment statements and iteration (loop) statements, the latter resembling the DO statement of FORTRAN, and special cases of the FOR and THROUGH statements of ALGOL and MAD. The bound on the running time of a Loop program is determined essentially by the length of the program and the depth of nesting of its loops.
{"title":"The complexity of loop programs","authors":"A. Meyer, D. Ritchie","doi":"10.1145/800196.806014","DOIUrl":"https://doi.org/10.1145/800196.806014","url":null,"abstract":"Anyone familiar with the theory of computability will be aware that practical conclusions from the theory must be drawn with caution. If a problem can theoretically be solved by computation, this does not mean that it is practical to do so. Conversely, if a problem is formally undecidable, this does not mean that the subcases of primary interest are impervious to solution by algorithmic methods. In the next section we describe such a class of programs, called “Loop programs.” Each Loop program consists only of assignment statements and iteration (loop) statements, the latter resembling the DO statement of FORTRAN, and special cases of the FOR and THROUGH statements of ALGOL and MAD. The bound on the running time of a Loop program is determined essentially by the length of the program and the depth of nesting of its loops.","PeriodicalId":257203,"journal":{"name":"Proceedings of the 1967 22nd national conference","volume":"28 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1967-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114133094","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In the light of accelerating interest, it seems worthwhile to review both the current status of TSS and some of the predictions made three years ago. Our review will include a brief overview of system changes, a discussion in some depth of resource allocation (which now appears to be the critical factor in general-purpose time-sharing systems), and some conclusions regarding how well our statements have withstood the test of time.
{"title":"The SDC Time-Sharing System revisited","authors":"J. I. Schwartz, C. Weissman","doi":"10.1145/800196.805996","DOIUrl":"https://doi.org/10.1145/800196.805996","url":null,"abstract":"In the light of accelerating interest, it seems worthwhile to review both the current status of TSS and some of the predictions made three years ago. Our review will include a brief overview of system changes, a discussion in some depth of resource allocation (which now appears to be the critical factor in general-purpose time-sharing systems), and some conclusions regarding how well our statements have withstood the test of time.","PeriodicalId":257203,"journal":{"name":"Proceedings of the 1967 22nd national conference","volume":"156 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1967-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121253489","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The fundamental goal of an evolutionary approach to upgrading a computer installation is the maintenance of a continuity of operation as various elements of the installation (equipment components and system support programs) are replaced. The realization of this goal requires the isolation and separation of the inter-dependencies which now exist between the various elements of a computer installation. This includes the inter-dependencies between programs and the characteristics of equipment components, between programs and the characteristics of other programs, and between equipment components and the characteristics of other equipment components.
{"title":"An approach to standardizing computer systems","authors":"Edward Morenoff, J. McLean","doi":"10.1145/800196.806021","DOIUrl":"https://doi.org/10.1145/800196.806021","url":null,"abstract":"The fundamental goal of an evolutionary approach to upgrading a computer installation is the maintenance of a continuity of operation as various elements of the installation (equipment components and system support programs) are replaced. The realization of this goal requires the isolation and separation of the inter-dependencies which now exist between the various elements of a computer installation. This includes the inter-dependencies between programs and the characteristics of equipment components, between programs and the characteristics of other programs, and between equipment components and the characteristics of other equipment components.","PeriodicalId":257203,"journal":{"name":"Proceedings of the 1967 22nd national conference","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1967-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131286346","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The following paper describes research that the authors are currently conducting in the development of a large, complex bank management simulation. The simulation, to be called the FDIC Bank Management Simulation, will be a computer model of commercial banks competing against one another and other financial institutions in the economic marketplace.
{"title":"FDIC Bank Management Simulation","authors":"K. J. Cohen, J. T. Heames","doi":"10.1145/800196.805989","DOIUrl":"https://doi.org/10.1145/800196.805989","url":null,"abstract":"The following paper describes research that the authors are currently conducting in the development of a large, complex bank management simulation. The simulation, to be called the FDIC Bank Management Simulation, will be a computer model of commercial banks competing against one another and other financial institutions in the economic marketplace.","PeriodicalId":257203,"journal":{"name":"Proceedings of the 1967 22nd national conference","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1967-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121785305","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper is intended as an introduction to some of the basic concepts of multiprogramming for readers who wish to study the more specialized literature in this field. It attempts to develop a framework for the discussion of multiprogramming which motivates the forms of machine organization used in current multiprogramming systems. The key requirement in multiprogramming systems is that information structures be represented in a hardware-independent form until the moment of execution, rather than being converted to a hardware-dependent form at load time. This requirement leads directly to the concept of hardware-independent virtual address spaces, and to the concept of virtual processors which are linked to physical computer resources through address mapping tables. The structure of the class of hardware-independent virtual processors in the IBM 360 model 67 and GE 645 systems (1), (2), (3), (4), is developed in some detail. Questions of efficiency of throughput in the resulting class of computer systems are considered.
本文旨在为希望研究该领域更专业文献的读者介绍多道程序设计的一些基本概念。它试图开发一个讨论多道程序设计的框架，以激发当前多道程序设计系统中使用的机器组织形式。多道程序设计系统的关键要求是，信息结构在执行之前都以与硬件无关的形式表示，而不是在加载时转换为与硬件相关的形式。这个需求直接导致了硬件无关的虚拟地址空间的概念，以及通过地址映射表链接到物理计算机资源的虚拟处理器的概念。对IBM 360 model 67和GE 645系统(1)、(2)、(3)、(4)中与硬件无关的虚拟处理器类的结构进行了详细的研究。考虑了由此产生的计算机系统的吞吐量效率问题。
{"title":"Machine organization for multiprogramming","authors":"P. Wegner","doi":"10.1145/800196.805984","DOIUrl":"https://doi.org/10.1145/800196.805984","url":null,"abstract":"This paper is intended as an introduction to some of the basic concepts of multiprogramming for readers who wish to study the more specialized literature in this field. It attempts to develop a framework for the discussion of multiprogramming which motivates the forms of machine organization used in current multiprogramming systems. The key requirement in multiprogramming systems is that information structures be represented in a hardware-independent form until the moment of execution, rather than being converted to a hardware-dependent form at load time. This requirement leads directly to the concept of hardware-independent virtual address spaces, and to the concept of virtual processors which are linked to physical computer resources through address mapping tables. The structure of the class of hardware-independent virtual processors in the IBM 360 model 67 and GE 645 systems (1), (2), (3), (4), is developed in some detail. Questions of efficiency of throughput in the resulting class of computer systems are considered.","PeriodicalId":257203,"journal":{"name":"Proceedings of the 1967 22nd national conference","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1967-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133833712","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Autodoc is a man-machine system designed to provide automated documentation capability to assist professional and secretarial personnel in carrying out their routine work assignments. The initial application is the production of user documentation. However, design intent is not limited to this single application. The completed system permits broad application by a variety of users. This system provides automated capability for document production, maintenance, and bookkeeping.
{"title":"Autodoc: Computer-based assistance for document production","authors":"M. Callahan, G. L. Grace","doi":"10.1145/800196.805987","DOIUrl":"https://doi.org/10.1145/800196.805987","url":null,"abstract":"Autodoc is a man-machine system designed to provide automated documentation capability to assist professional and secretarial personnel in carrying out their routine work assignments. The initial application is the production of user documentation. However, design intent is not limited to this single application. The completed system permits broad application by a variety of users. This system provides automated capability for document production, maintenance, and bookkeeping.","PeriodicalId":257203,"journal":{"name":"Proceedings of the 1967 22nd national conference","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1967-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132984346","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A phytosociological table is a matrix, each of whose rows corresponds to the occurrence of a particular plant species and each of whose columns corresponds to a sample plot in which the several species occur. Each plot list is called a releve. The elements of this matrix are binary, corresponding to the presence or absence of each species in each plot. Thus if the ith species is present in the jth releve, then the ijth element of the phytosociological table is equal to one; if the ith species is not present in the jth releve, then the ijth element is equal to zero. For over half a century, botanists have used tables of this kind to indicate patterns of association among species of plants by showing which combinations of species are either mutually present or mutually absent in groups of releves.1 One of the major problems in communicating the information in one of these tables is the problem of arranging the order of the rows and columns of the table so as best to display the relationships of mutual presence and mutual absence among the species. This problem has been solved in the past by selecting the best of a series of trial arrangements, based on the botanist's experience of putative associations among the several plant species and similarities among the releves in the table. While this method is adequate for most displays, it suffers from at least two serious drawbacks. First, the number of trial arrangements which the botanist may test in a reasonable amount of time is quite small; second, the arrangements which are most likely to be attempted are highly dependent on the training and experience of the individual botanist. In other words, it is quite possible that the “best” arrangement of species and releves for the display of a particular phytosociological table may vary substantially from botanist to botanist. In the interest of speeding up this procedure and making it more objective, we present a computer program for the arrangement of phytosociological tables.
{"title":"A computer method for the arrangement of phytosociological tables","authors":"G. Moore, W. S. Benninghoff, P. S. Dwyer","doi":"10.1145/800196.805999","DOIUrl":"https://doi.org/10.1145/800196.805999","url":null,"abstract":"A phytosociological table is a matrix, each of whose rows corresponds to the occurrence of a particular plant species and each of whose columns corresponds to a sample plot in which the several species occur. Each plot list is called a releve. The elements of this matrix are binary, corresponding to the presence or absence of each species in each plot. Thus if the ith species is present in the jth releve, then the ijth element of the phytosociological table is equal to one; if the ith species is not present in the jth releve, then the ijth element is equal to zero. For over half a century, botanists have used tables of this kind to indicate patterns of association among species of plants by showing which combinations of species are either mutually present or mutually absent in groups of releves.1 One of the major problems in communicating the information in one of these tables is the problem of arranging the order of the rows and columns of the table so as best to display the relationships of mutual presence and mutual absence among the species. This problem has been solved in the past by selecting the best of a series of trial arrangements, based on the botanist's experience of putative associations among the several plant species and similarities among the releves in the table. While this method is adequate for most displays, it suffers from at least two serious drawbacks. First, the number of trial arrangements which the botanist may test in a reasonable amount of time is quite small; second, the arrangements which are most likely to be attempted are highly dependent on the training and experience of the individual botanist. In other words, it is quite possible that the “best” arrangement of species and releves for the display of a particular phytosociological table may vary substantially from botanist to botanist. In the interest of speeding up this procedure and making it more objective, we present a computer program for the arrangement of phytosociological tables.","PeriodicalId":257203,"journal":{"name":"Proceedings of the 1967 22nd national conference","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1967-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116126866","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Chebyshev series can be used not only for representing explicit functions but also for solving differential equations. Two Chebyshev methods, the selected points method and the tau method, have been described by Lanczos2 for the solution of ordinary differential equations. Moreover both methods have applications to partial differential equations. In a previous paper1 we have applied the selected points technique to derive a two-dimensional Chebyshev method for the solution of partial differential equations over bounded regions. And in the present paper we generalize the tau method to provide a one-dimensional method for the solution of the heat conduction equation over an infinite strip.
{"title":"A Chebyshev method for the numerical solution of the one-dimensional heat equation","authors":"J. Mason","doi":"10.1145/800196.805982","DOIUrl":"https://doi.org/10.1145/800196.805982","url":null,"abstract":"Chebyshev series can be used not only for representing explicit functions but also for solving differential equations. Two Chebyshev methods, the selected points method and the tau method, have been described by Lanczos2 for the solution of ordinary differential equations. Moreover both methods have applications to partial differential equations. In a previous paper1 we have applied the selected points technique to derive a two-dimensional Chebyshev method for the solution of partial differential equations over bounded regions. And in the present paper we generalize the tau method to provide a one-dimensional method for the solution of the heat conduction equation over an infinite strip.","PeriodicalId":257203,"journal":{"name":"Proceedings of the 1967 22nd national conference","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1967-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116082167","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper describes a computer program called UMPIRE that performs all the functions of an actual live referee for the game of Kriegsspiel. The program is written in LISP 1.5 for the System Development Corporation Q-32 Time-Sharing System. With slight modifications to the I/O functions, UMPIRE could be made operable on any computer having a LISP 1.5 compiler. The basic functions of the program are translatable into LISP 2.
{"title":"UMPIRE: An automatic Kriegsspiel referee for a time-shared computer","authors":"John F. Burger","doi":"10.1145/800196.805988","DOIUrl":"https://doi.org/10.1145/800196.805988","url":null,"abstract":"This paper describes a computer program called UMPIRE that performs all the functions of an actual live referee for the game of Kriegsspiel. The program is written in LISP 1.5 for the System Development Corporation Q-32 Time-Sharing System. With slight modifications to the I/O functions, UMPIRE could be made operable on any computer having a LISP 1.5 compiler. The basic functions of the program are translatable into LISP 2.","PeriodicalId":257203,"journal":{"name":"Proceedings of the 1967 22nd national conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1967-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130256707","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：