Computable functions and semicomputable sets on many-sorted algebras

By J. V. Tucker, J. Zucker. Logic in Computer Science, 2001

104 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics, Statistics and Probability

View Paper: https://www.semanticscholar.org/paper/82ab46ef0fe7bf2714a7d5a21cb5f0ca6463145a

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Ana Cecília Fieler
2. Walter Briec
3. Kristiaan Kerstens
4. M. Bumin Yenmez
5. Federico Echenique
6. Bozidar Radunovic
7. Dilip Mookherjee
8. Maitreesh Ghatak

Citations in the corpus

• Unifying computers and dynamical systems using the theory of synchronous concurrent algorithms (2009, background): “Since the emphasis in this paper is on the a general mathematical model of SCAs, it will be helpful if the reader has some familiarity with theory for algorithmic computability on discrete and continuous data [54,74,65,68,58].”