Showing papers on "Computability published in 1968"
01 Jan 1968
TL;DR: There must be some kind of “correspondence principle” by means of which transfer of concepts can be made between discrete and continuous models, and the development of such a principle and the implications for the description of metabolic control and regulation are concerned.
Abstract: A wide variety of important biological systems admit both a continuous and a discrete representation. For example, the central nervous system can be described in terms of both a continuous two-factor theory and a discrete theory of neural nets; biochemical control systems admit a continuous theory of chemical kinetics and a discrete theory of “biochemical automata”. Each of these representations possesses an intrinsic character not shared by the other; for example we may talk about transient behavior and stability in continuous systems, and about computability in discrete systems, but we cannot at present transfer such concepts readily from one sphere to the other. Nevertheless, from the fact that both kinds of theories describe the same systems, there must be some kind of “correspondence principle” by means of which transfer of concepts can be made between discrete and continuous models. We shall be concerned with the development of such a principle, and the implications of this principle for the description of metabolic control and regulation.
8 citations
TL;DR: A number of courses are listed in the area described as automata, formal languages, abstract switching, and computability, that might be available to a Ph.D. student in computer science.
Abstract: A number of courses are listed in the area described as automata, formal languages, abstract switching, and computability, that might be available to a Ph.D. student in computer science. A brief catalog description of each course is supplied and the role of each of the courses in the graduate program is discussed.
4 citations
15 Oct 1968
TL;DR: It is shown that this family of all languages generated by context-sensitive grammars whose time functions are linear-bounded is an AFL closed under reversal, and its relationship to several well-studied families of formal languages is shown.
Abstract: In this paper we consider the family of all languages generated by context-sensitive grammars whose time functions are linear-bounded. It is shown that this family is an AFL closed under reversal, and we show its relationship to several well-studied families of formal languages.
3 citations
01 Jul 1968
TL;DR: In this article, a straightforward algorithm for converting context free grammars into pushdown-store automata is presented. But this algorithm is not suitable for pushdown store automata.
Abstract: Straightforward algorithm for converting context free grammars into pushdown-store automata