This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
W. Ackermann. Zum Hilbertschen Aufbau der reelen Zahlen. Mathematische Annalen, 99:118–133, 1928.
B. Allen. Arithmetizing uniform NC. Annals of Pure and Applied Logic, 53(1):1–50, 1991.
D. Mix Barrington, N. Immerman, and H. Straubing. On uniformity in NC 1. Journal of Computer and System Science, 41(3):274–306, 1990.
D.A. Barrington. Bounded-width polynomial-size branching programs recognize exactly those languages in NC 1. Journal of Computer and System Sciences, 38:150–164, 1989.
S. Bellantoni. Predicative recursion and computational complexity. Technical Report 264/92, University of Toronto, Computer Science Department, September 1992. 164 pages.
S. Bellantoni. Predicative recursion and the polytime hierarchy. In P. Clote and J. Remmel, editors, Feasible Mathematics II, pages 15–29. Birkhäuser, 1995.
S. Bellantoni and S. Cook. A new recursion-theoretic characterization of the polytime functions. Computational Complexity, 2:97–110, 1992.
A. Bel'tyukov. A computer description and a hierarchy of initial Grzegorczyk classes. Journal of Soviet Mathematics, 20:2280–2289, 1982. Translation from Zap. Nauk. Sem. Lening. Otd. Mat. Inst., V. A. Steklova AN SSSR, Vol. 88, pp. 30–46, 1979.
J.H. Bennett. On Spectra. PhD thesis, Princeton University, 1962. Department of Mathematics.
S. Bloch. Function-algebraic characterizations of log and polylog parallel time. Computational Complexity, 4(2):175–205, 1994.
S. Buss. Bounded Arithmetic, volume 3 of Studies in Proof Theory. Bibliopolis, 1986. 221 pages.
S. Buss. The polynomial hierarchy and intuitionistic bounded arithmetic. In A.L. Selman, editor, Structure in Complexity Theory, volume 223, pages 77–103. 1986. Springer Lecture Notes in Computer Science.
J.-Y. Cai and M.L. Furst. PSPACE survives three-bit bottlenecks. In Proceedings of 3th Annual IEEE Conference on Structure in Complexity Theory, pages 94–102, 1988.
A. Chandra, D. Kozen, and L. J. Stockmeyer. Alternation. Journal of the Association of Computing Machinery, 28:114–133, 1981.
A. Church. An unsolvable problem in elementary number theory. American Journal of Mathematics, 58:345–363, 1936.
P. Clote. A time-space hierarchy between P and PSPACE. Mathematical Systems Theory, 25:77–92, 1992.
P. Clote. Polynomial size frege proofs of certain combinatorial principles. In P. Clote and J. Krajíček, editors, Arithmetic, Proof Theory and Computational Complexity, pages 162–184. Oxford University Press, 1993.
P. Clote. Nondeterministic stack register machines. Submitted.
P. Clote, B. Kapron, and A. Ignjatovic. Parallel computable higher type functionals. Technical Report BCCS-94-04, Department of Computer Science, Boston College, June 1994.
P. Clote, B. Kapron, and A. Ignjatovic. Parallel computable higher type functionals. In Proceedings of IEEE 34th Annual Symposium on Foundations of Computer Science, Nov 3–5, 1993. Palo Alto CA. pp. 72–83.
P. Clote and G. Takeuti. Exponential time and bounded arithmetic. In A.L. Selman, editor, Structure in Complexity Theory, volume 223, pages 125–143. Springer Lecture Notes in Computer Science, 1986.
P. Clote and G. Takeuti. Bounded arithmetics for NC, ALOGTIME, L and NL. Annals of Pure and Applied Logic, 56:73–117, 1992.
P. Clote and G. Takeuti. First order bounded arithmetic and small boolean circuit complexity classes. In P. Clote and J. Remmel, editors, Feasible Mathematics II, pages 154–218. Birkhäuser Boston Inc., 1995.
P.G. Clote. A sequential characterization of the parallel complexity class NC Technical Report BCCS-88-07, Department of Computer Science, Boston College, 1988.
P.G. Clote. Sequential, machine-independent characterizations of the parallel complexity classes ALOGTIME, AC k, NCk and NC. In P.J. Scott S.R. Buss, editor, Feasible Mathematics, pages 49–70. Birkhäuser, 1990.
A. Cobham. The intrinsic computational difficulty of functions. In Y. Bar-Hillel, editor, Logic, Methodology and Philosophy of Science II, pages 24–30. North-Holland, 1965.
R. Constable. Type 2 computational complexity. In 5th Annual ACM Symposium on Theory of Computing, 1973. pp. 108–121.
S. Cook. Computability and complexity of higher type functions. In Y.N. Moschovakis, editor, Logic from Computer Science, pages 51–72. Springer Verlag, 1992.
S.A. Cook and B.M. Kapron. Characterizations of the feasible functional of finite type. In P.J. Scott S.R. Buss, editor, Feasible Mathematics, pages 71–98. Birkhäuser, 1990.
S.A. Cook and A. Urquhart. Functional interpretations of feasibly constructive arithmetic. Annals of Pure and Applied Logic, 63(2):pp. 103–200, 1993.
R. Fagin. Generalized first-order spectra and polynomial-time recognizable sets. In R. M. Karp, editor, Complexity of Computation, SIAM-AMS Proceedings, Vol. 7, pages 43–73, 1974.
R. Fagin. Finite-model theory—a personal perspective. In S. Abiteboul and P. Kanellakis, editors, Proc. 1990 International Conference on Database Theory, pages 3–24. Springer-Verlag Lecture Notes in Computer Science 470, 1990. Journal version to appear in Theoretical Computer Science.
S. Fortune and J. Wyllie. Parallelism in random access machines. In 10th Annual ACM Symposium on Theory of Computing, 1978. pp. 114–118.
J.-Y. Girard, A. Scedrov, and P. Scott. Bounded linear logic. In P.J. Scott S.R. Buss, editor, Feasible Mathematics, pages 195–210. Birkhäuser, 1990.
K. Gödel. Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme. J. Monat. Math. Phys., 38:173–198, 1931.
K. Gödel. Conversation with G.E. Sacks. Institute for Advanced Study, 1975.
L. Goldschlager. Synchronous parallel computation. Technical Report 114, University of Toronto, December 1977. 131 pages.
L. Goldschlager. A unified approach to models of synchronous parallel machines. Journal of the Association of Computing Machinery, 29(4):pp. 1073–1086, October 1982.
A. Grzegorczyk. Some clases of recursive functions. Rozprawy Matematyczne, 4, 1953.
Y. Gurevich. Algebras of feasible functions. In Proceedings of 24th IEEE Symposium on Foundations of Computer Science, 1983. pp. 210–214.
Y. Gurevich and S. Shelah. Nearly linear time. Symposium on Logical Foundations of Computer Science, Springer Lecture Notes in Computer Science(363):108–118, 1989. Pereslavl-Zalessky, USSR.
W. Handley, J. B. Paris, and A. J. Wilkie. Characterizing some low arithmetic classes. In Theory of Algorithms, pages 353–364. Akademie Kyado, Budapest, 1984. Colloquia Societatis Janos Bolyai.
W.G. Handley. LTH plus nondeterministic summation mod M 3 yields ALIN-TIME. Submitted, 22 December 1994.
W.G. Handley. Deterministic summation modulo β n, the semi-group of binary relations on 1, {O, ..., n−1}. Submitted, May 1994.
V. Harnik. Provably total functions of intuitionistic bounded arithmetic. Journal of Symbolic Logic, 57(2):466–477, 1992.
K. Harrow. Small Grzegorczyk classes and limited minimum. Zeit. Math. Logik, 21:417–426, 1975.
K. Harrow. Equivalence of some hierarchies of primitive recursive functions. Zeit. Math. Logik, 25:411–418, 1979.
D. Hilbert. Über das Unendliche. Mathematische Annalen, 95:161–190, 1925.
H. James Hoover. Feasibly constructive analysis. Technical Report 206/87, University of Toronto, November 1987. 114 pages.
H.J. Hoover. Computational models for feasible real analysis. In S.R. Buss and P.J. Scott, editors, Feasible Mathematics, pages 221–238. Birkhäuser, 1990.
A. Ignjatovic. Some applications of logic to feasibility in higher types. Typescript and invited talk at meeting LCC, Indianapolis, organizer D. Leivant, October 13–16 1994.
N. Immerman. Languages that capture complexity classes. SIAM Journal of Computing, 16:760–778, 1987.
N. Immerman. Expressibility and parallel complexity. SIAM J. Comput., 18(3):625–638, 1989.
N.D. Jones and A.L. Selman. Turing machines and the spectra of first-order formulas. Journal of Symbolic Logic, 39:139–150, 1974.
L. Kalmar. Egyszerü példa eldönthetetlen aritmetikai problémára. Mate és Fizikai Lapok, 50:1–23, 1943. [In Hungarian with German abstract].
B. Kapron and S. Cook. A new characterization of Mehlhorn's poly time functionals. In Proceedings of IEEE 32th Annual Symposium on Foundations of Computer Science, pages pp. 342–347, 1991. to appear in SIAM J. on Comput.
S.C. Kleene. General recursive functions of natural numbers. Math. Ann., 112:727–742, 1936.
S.C. Kleene. Lambda-definability and recursiveness. Duke Mathematical Journal, 2:340–353, 1936.
Ker-I Ko. Applying techniques of discrete complexity theory to numerical computation. In R.V. Book, editor, Studies in Complexity Theory, pages 1–62. John Wiley and Sons, Inc, 1986.
G. Kreisel, D. Lacombe, and J.R. Shoenfield. Partial recursive functionals and effective operations. In A. Heyting, editor, Constructivity in Mathematics: Proceedings of a colloquium held in Amsterdam, pages 195–207. North Holland, 1957.
M. Kutyłowski. Finite automata, real time processes and counting problems in bounded arithmetics. Journal of Symbolic Logic, 53(1):243–258, 1988.
D. Leivant. Ramified recurrence and computational complexity I: word recurrence and poly-time. In P. Clote and J. Remmel, editors, Feasible Mathematics II, pages 320–343. Birkhäuser, 1994.
D. Leivant and J.-Y. Marion. Lambda-calculus characterizations of poly-time. Fundamenta Informaticae, 19:167–184, 1993.
J.C. Lind. Computing in logarithmic space. Technical Report Project MAC Technical Memorandum 52, Massachusetts Institute of Technology, September 1974.
K. Mehlhorn. Polynomial and abstract subrecursive classes. Journal of Computer and System Science, 12:147–178, 1976.
B. Monien. A recursive and grammatical characterization of exponential time languages. Theoretical Computer Science, 3:61–74, 1977.
A. Nerode, J. Remmel, and A. Scedrov. Polynomially graded logic I — a graded version of system T. In Proceedings of IEEE 4th Annual Symposium on Logic in Computer Science, 1989.
K.-H. Niggl. Subrecursive hierarchies on Scott domains. Archive for Mathematical Logic, 32:239–257, 1993.
J. Otto. Tiers, tensors, and Δ 00 . Talk at meeting LCC, Indianapolis, organizer D. Leivant, October 13–16 1994.
S.V. Pakhomov. Machine independent description of some machine complexity classes (in Russian). Issledovanija po konstrukt. matermat, i mat. logike, VIII:176–185, LOMI 1979.
J. B. Paris and A. J. Wilkie. Counting problems in bounded arithmetic. In C. A. di Prisco, editor, Methods in Mathematical Logic, pages 317–340. Springer Verlag Lecture Notes in Mathematics, 1983. Proceedings of Logic Conference held in Caracas, 1983.
R. Péter. Über die mehrfache Rekursion. Mathematische Annalen, 113:489–526, 1936.
R.W. Ritchie. Classes of predictably computable functions. Trans. Am. Math. Soc., 106:139–173, 1963.
J. Robinson. Definability and decision problems in arithmetic. Journal of Symbolic Logic, 14:98–114, 1949.
H. E. Rose. Subrecursion: Function and Hierarchies, volume 9 of Oxford Logic Guides. Clarendon Press, Oxford, 1984. 191 pages.
J.S. Royer. Semantics vs. syntax vs. computation. Typescript, November 29, 1994.
W.L. Ruzzo. On uniform circuit complexity. J. Comput. System Sci., 22:pp. 365–383, 1981.
C. P. Schnorr. Satisfiability is quasilinear complete in NQL. Journal of the Association of Computing Machinery, 25(1):136–145, 1978.
H. Scholz. Ein ungelöstes Problem in der symbolischen Logik. Journal of Symbolic Logic, 17:160, 1952.
H. Schwichtenberg. Primitive recursion on the partial continuous functionals. In M. Broy, editor, Informatik und Mathematik, pages 251–259. Springer-Verlag, 1991.
A. Seth. There is no recursive axiomatization for feasible functionals of type 2. In Proceedings of IEEE 7th Annual Symposium on Logic in Computer Science, 1992. pp. 286–295.
A. Seth. Some desirable conditions for feasible functionals of type 2. In Proceedings of IEEE 8th Annual Symposium on Logic in Computer Science, 1993.
A. Seth. Turing machine characterizations of feasible functionals of all finite types. In P. Clote and J. Remmel, editors, Feasible Mathematics II, pages 407–428. Birkhäuser, 1994.
Y. Shiloach and U. Vishkin. Finding the maximum, merging and sorting in a parallel computation model. Journal of Algorithms, 3:57–67, 1982.
L. Stockmeyer and U. Vishkin. Simulation of parallel random access machines by circuits. SIAM Journal on Computing, 13:409–422, 1984.
D.B. Thompson. Subrecursiveness: machine independent notions of computability in restricted time and storage. Math. Systems Theory, 6:3–15, 1972.
M. Townsend. Complexity for type-2 relations. Notre Dame Journal of Formal Logic, 31:241–262, 1990.
A.M. Turing. On computable numbers, with an application to the Entscheidungsproblem. Proc. Lond. Math. Soc., Series 2, 42:230–265, 1936–37.
K. Wagner. Bounded recursion and complexity classes. In Lecture Notes in Computer Science, volume 74, pages 492–498. Springer-Verlag, 1979.
K. Wagner and G. Wechsung. Computational Complexity. Reidel Publishing Co., 1986.
A. Woods. Bounded arithmetic formulas and Turing machines of constant alternation. In J.B. Paris, A.J. Wilkie, and G.M. Wilmers, editors, Logic Coloquium 1984. North Holland, 1986.
C. Wrathall. Complete sets and the polynomial time hierarchy. Theoretical Computer Science, 3:23–33, 1976.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Clote, P. (1995). Computation models and function algebras. In: Leivant, D. (eds) Logic and Computational Complexity. LCC 1994. Lecture Notes in Computer Science, vol 960. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60178-3_81
Download citation
DOI: https://doi.org/10.1007/3-540-60178-3_81
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60178-4
Online ISBN: 978-3-540-44720-7
eBook Packages: Springer Book Archive