Feferman on computability

DOI10.1007/978-3-319-63334-3_2MaRDI QIDQ5214780zbMATH OpenOpenAlexFDO

Authors Jeffery Zucker

Publication date 5 February 2020

Published in Outstanding Contributions to Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-63334-3_2

zbMATH Keywords

abstract data types computing on streamscomputing on realsFefermangeneralized computability

Mathematics Subject Classification ID

History of mathematics in the 20th century (01A60) History of mathematical logic and foundations (03-03) Higher-type and set recursion theory (03D65) Inductive definability (03D70) Abstract and axiomatic computability and recursion theory (03D75) Computation over the reals, computable analysis (03D78)

Recommendations

• scientific article; zbMATH DE number 1390011
• Computability in special models
• Computability theory. Abstracts from the workshop held February 5--11, 2012.
• scientific article; zbMATH DE number 1955470
• Feferman on foundations. Logic, mathematics, philosophy

Cites work

• A new approach to abstract data types, I Informal development
• Abstract First Order Computability. I
• Abstract versus concrete computation on metric partial algebras
• Algorithmic Procedures
• COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
• Computable functionals
• Computable functionals of finite types
• Computation on abstract data types. The extensional approach, with an application to streams
• Computing over the reals: foundations for scientific computing.
• Continuity of operators on continuous and discrete time streams
• Effective operations on partial recursive functions
• Elementary induction on abstract structures
• Finite alogorithmic procedures and computation theories.
• Finite alogorithmic procedures and inductive definability.
• scientific article; zbMATH DE number 3112803 (Why is no real title available?)
• scientific article; zbMATH DE number 3163761 (Why is no real title available?)
• scientific article; zbMATH DE number 3900744 (Why is no real title available?)
• scientific article; zbMATH DE number 3966062 (Why is no real title available?)
• scientific article; zbMATH DE number 4070894 (Why is no real title available?)
• scientific article; zbMATH DE number 3655923 (Why is no real title available?)
• scientific article; zbMATH DE number 3697103 (Why is no real title available?)
• scientific article; zbMATH DE number 42077 (Why is no real title available?)
• scientific article; zbMATH DE number 192929 (Why is no real title available?)
• scientific article; zbMATH DE number 3531367 (Why is no real title available?)
• scientific article; zbMATH DE number 3556031 (Why is no real title available?)
• scientific article; zbMATH DE number 3583802 (Why is no real title available?)
• scientific article; zbMATH DE number 408790 (Why is no real title available?)
• scientific article; zbMATH DE number 1460545 (Why is no real title available?)
• scientific article; zbMATH DE number 3445233 (Why is no real title available?)
• scientific article; zbMATH DE number 2115098 (Why is no real title available?)
• scientific article; zbMATH DE number 3212274 (Why is no real title available?)
• scientific article; zbMATH DE number 3216998 (Why is no real title available?)
• scientific article; zbMATH DE number 5033764 (Why is no real title available?)
• scientific article; zbMATH DE number 3291139 (Why is no real title available?)
• scientific article; zbMATH DE number 3349780 (Why is no real title available?)
• scientific article; zbMATH DE number 3383999 (Why is no real title available?)
• scientific article; zbMATH DE number 3195586 (Why is no real title available?)
• scientific article; zbMATH DE number 3073037 (Why is no real title available?)
• scientific article; zbMATH DE number 3077999 (Why is no real title available?)
• Initial Algebra Semantics and Continuous Algebras
• Initial and Final Algebra Semantics for Data Type Specifications: Two Characterization Theorems
• Logic colloquium '78. Proceedings of the colloquium held in Mons, August 1978.
• Maximal and everywhere-defined functionals
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• On the definitions of computable real continuous functions
• Quantifier elimination and cylindrical algebraic decomposition. Proceedings of a symposium, Linz, Austria, October 6--8, 1993
• Recursive Functionals and Quantifiers of Finite Types I
• The formal language of recursion
• Theory of Formal Systems. (AM-47)
• Toward a constructive theory of unbounded linear operators
• Translating recursion equations into flow charts

Cited in

(2)

• Polynomial upper bounds on the size of changes of a RAM+BOOL program as a tool for proving belonging to FP
• Introduction -- Feferman 1977

This page was built for publication: Feferman on computability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5214780)