From logic to theoretical computer science
The author describes his career in the Soviet Union, mostly up to around 1970. He records his training in the Ukraine, contacts in Moscow with both mathematicians (especially with A. N. Kolmogorov) and logicians (especially with S. A. Yanovskaya), and employment in Penza and then Novosibirsk. Many of the social circumstances and relationships recorded are little known in the West. He also relates his intellectual progress. Broadly speaking, he passed from descriptive set theory through proof theory and recursion to computational complexity and finite automata. He gives some attention to the ``perebor (or brute force) algorithms, with which he has been especially associated. For the entire collection see [Zbl 0913.00024].
- scientific article; zbMATH DE number 432645
- From Logic to Theoretical Computer Science – An Update
- From logic to computer science and back
- From universal logic to computer science, and back
- Foundations of logic and theory of computation
- scientific article; zbMATH DE number 6154472
- scientific article; zbMATH DE number 52096
- scientific article; zbMATH DE number 3992928
- Computational logic: its origins and applications
- Introduction to computability logic
- Homage to Michael Gelfond on his 65th birthday
- Yuri, logic, and computer science
- scientific article; zbMATH DE number 1164002 (Why is no real title available?)
- scientific article; zbMATH DE number 1361527 (Why is no real title available?)
- scientific article; zbMATH DE number 1926652 (Why is no real title available?)
- scientific article; zbMATH DE number 3992917 (Why is no real title available?)
- From Logic to Theoretical Computer Science – An Update
- Ivan Soskov: a life in computability
This page was built for publication: From logic to theoretical computer science
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4263952)
