Language: English

Jump To : Overview Titles Subjects

Computable functions.

Overview

Works:	18 works in 9 publications in 9 languages

Titles

Automata Theory and Formal Languages = Fundamental Notions, Theorems, and Techniques / by: (Language materials, printed)

Computability by: (Language materials, printed)

Reverse Mathematics = Problems, Reductions, and Proofs / by: (Language materials, printed)

New Computational Paradigms = Changing Conceptions of What is Computable / by: (Language materials, printed)

Hypercomputation = computing beyond the Church-Turing barrier / by: (Language materials, printed)

Computable models by: (Language materials, printed)

The foundations of computability theory by: (Language materials, printed)

Higher-order computability by: (Language materials, printed)

Turing's revolution = the impact of his ideas about computability / by: (Language materials, printed)

Models of computation = an introduction to computability theory / by: (Language materials, printed)

Subjects

Technology—Philosophy.

Artificial intelligence.

Model theory.

Theory of Computation.

Mathematical Logic and Foundations.

Logics and Meanings of Programs.

Computer science

Enigma cipher system.

Computational Mathematics and Numerical Analysis.

Computational complexity.

Mathematics.

Machine theory.

Philosophy.

Algorithm Analysis and Problem Complexity.

Coding and Information Theory.

Formal Languages and Automata Theory.

Language Translation and Linguistics.

Mathematics of Computing.

Computer Science.

Philosophy of Science.

Set theory.

Philosophy of Technology.

Computer science.

Turing test.

Quantum Computing, Information and Physics.

Computation by Abstract Devices.

Computer Science Logic and Foundations of Programming.

Mathematical logic.

Computer science—Mathematics.

Theory and Algorithms for Application Domains.

Math Applications in Computer Science.

Turing machines.

Turing, Alan Mathison,

History of Computing.

Logic.

Computable functions.

Mathematical Logic and Formal Languages.

Models of Computation.

History of Mathematical Sciences.

Recursion theory.

Artificial Intelligence (incl. Robotics)

Unsolvability (Mathematical logic)

Programming Languages, Compilers, Interpreters.

Computability and Recursion Theory.

Software Engineering/Programming and Operating Systems.

Computational Complexity.

Computational intelligence.

Logic, Symbolic and mathematical.

Mathematics

History of Science.

Cryptography.