Topic
Computability
About: Computability is a research topic. Over the lifetime, 2829 publications have been published within this topic receiving 85162 citations.
Papers published on a yearly basis
Papers
More filters
30 Jun 2006
TL;DR: - Can general relativistic computers break the Turing barrier?
Abstract: Can general relativistic computers break the Turing barrier? – Are there final limits to human knowledge? – Limitative results versus human creativity (paradigm shifts). – Godel's logical results in comparison/combination with Godel's relativistic results. – Can Hilbert's programme be carried through after all?
23 citations
24 Jun 2002
TL;DR: The topic of Computability Theory is presented here as an example for demonstrating how research in Computing Science education can use learning theories, "borrowed" from mathematics education research, for explaining learning processes.
Abstract: The paper illustrates how theories from mathematics education can be applied for explaining student conception of computing science ideas. It does this by demonstrating how the theme of reducing abstraction [5] can be used for analyzing students' mental processes when the students are in the process of solving problems in Computability Theory. The topic of Computability Theory in presented here as an example for demonstrating how research in Computing Science education can use learning theories, "borrowed" from mathematics education research, for explaining learning processes.
23 citations
23 citations
30 Aug 1999
TL;DR: The succinctness of recognizing regular languages by Watson-Crick (arbitrary or 1-limited) automata in comparison with non-deterministic finite automata is investigated, as well as decidability and computability questions.
Abstract: We consider the number of states and the number of transitions in Watson-Crick finite (non-deterministic) automata as descriptional complexity measures. The succinctness of recognizing regular languages by Watson-Crick (arbitrary or 1-limited) automata in comparison with non-deterministic finite automata is investigated, as well as decidability and computability questions. Major differences are found between finite automata and Watson-Crick finite automata from both these points of view.
23 citations
TL;DR: The main technical result of this paper is constructing a sound and complete axiomatization for the propositional fragment of computability logic whose vocabulary includes all four kinds of conjunction and disjunction: parallel, toggling, sequential and choice, together with negation.
23 citations