6 found
  1.  7
    Universal Algebra.Karl Meinke & John V. Tucker - 1992 - In S. Abramsky, D. Gabbay & T. Maibaurn (eds.), Journal of Symbolic Logic. Oxford University Press. pp. 1--189.
  2.  20
    Computable and Continuous Partial Homomorphisms on Metric Partial Algebras.Viggo Stoltenberg-Hansen & John V. Tucker - 2003 - Bulletin of Symbolic Logic 9 (3):299-334.
    We analyse the connection between the computability and continuity of functions in the case of homomorphisms between topological algebraic structures. Inspired by the Pour-El and Richards equivalence theorem between computability and boundedness for closed linear operators on Banach spaces, we study the rather general situation of partial homomorphisms between metric partial universal algebras. First, we develop a set of basic notions and results that reveal some of the delicate algebraic, topological and effective properties of partial algebras. Our main computability concepts (...)
    Direct download (9 more)  
    Export citation  
    Bookmark   2 citations  
  3.  36
    Physical Oracles: The Turing Machine and the Wheatstone Bridge.Edwin J. Beggs, José Félix Costa & John V. Tucker - 2010 - Studia Logica 95 (1-2):279-300.
    Earlier, we have studied computations possible by physical systems and by algorithms combined with physical systems. In particular, we have analysed the idea of using an experiment as an oracle to an abstract computational device, such as the Turing machine. The theory of composite machines of this kind can be used to understand (a) a Turing machine receiving extra computational power from a physical process, or (b) an experimenter modelled as a Turing machine performing a test of a known physical (...)
    Direct download (7 more)  
    Export citation  
  4.  12
    Mr2729665 (2012b: 68075) 68q05.Edwin J. Beggs, José Félix Costa & John V. Tucker - 2010 - Studia Logica 95 (1-2):279-300.
    Direct download  
    Export citation  
  5.  13
    Stability of Representations of Effective Partial Algebras.Jens Blanck, Viggo Stoltenberg‐Hansen & John V. Tucker - 2011 - Mathematical Logic Quarterly 57 (2):217-231.
    An algebra is effective if its operations are computable under some numbering. When are two numberings of an effective partial algebra equivalent? For example, the computable real numbers form an effective field and two effective numberings of the field of computable reals are equivalent if the limit operator is assumed to be computable in the numberings . To answer the question for effective algebras in general, we give a general method based on an algebraic analysis of approximations by elements of (...)
    Direct download (6 more)  
    Export citation  
  6.  7
    Three Forms of Physical Measurement and Their Computability.Edwin Beggs, José Félix Costa & John V. Tucker - 2014 - Review of Symbolic Logic 7 (4):618-646.
    Direct download (3 more)  
    Export citation