Computation Theory and Logic
Book information
Description
This volume contains 37 invited research papers collected in memory of Dieter Rödding, who is known for his work on the classification of recursive functions, on reduction classes, on the spectrum problem and on the complexity of cardinality quantifiers in predicate logic and in arithmetical hierarchy. He was one of the first to pursue the interaction of logic and computer science. The volume reflects the wide spectrum of Dieter Rödding's scientific interests.
Similar books
Topics in Theoretical Computer Science: Second IFIP WG 1.8 International Conference, TTCS 2017, Tehran, Iran, September 12-14, 2017, Proceedings
2017 · PDF
Simulated Evolution and Learning: 11th International Conference, SEAL 2017, Shenzhen, China, November 10–13, 2017, Proceedings
2017 · PDF
Cellular Automata and Discrete Complex Systems: 20th International Workshop, AUTOMATA 2014, Himeji, Japan, July 7-9, 2014, Revised Selected Papers
2015 · PDF
Theoretical Aspects of Computing – ICTAC 2010: 7th International Colloquium, Natal, Rio Grande do Norte, Brazil, September 1-3, 2010. Proceedings
2010 · PDF
Probabilistic Analysis of Algorithms: On Computing Methodologies for Computer Algorithms Performance Evaluation
1987 · PDF
Products of Automata
1986 · PDF
Fundamentals of Computation Theory: Proceedings of the 1981 International FCT-Conference, Szeged, Hungary August 24–28, 1981
1981 · PDF
Graphtheoretic Concepts in Computer Science: Proceedings of the International Workshop WG 80 Bad Honnef, June 15–18, 1980
1981 · PDF