Semi-effective numberings and definitions of the computable numbers

DOI10.1007/BF01967819zbMATH Open0179.01901MaRDI QIDQ5569449FDOQ5569449

Authors: Brian H. Mayoh 

Publication date: 1968

Published in: Archiv für Mathematische Logik und Grundlagenforschung (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/137810

zbMATH Keywords

recursion theory, constructive mathematics

Cites Work

• Title not available (Why is that?)
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Nicht konstruktiv beweisbare Sätze der Analysis
• Gödel numberings of partial recursive functions
• Godel Numberings Versus Friedberg Numberings
• Title not available (Why is that?)
• On computable sequences
• Recursive real numbers
• Continued Function Expansions of Real Numbers
• On primitive recursive real numbers
• Notation Systems and an Effective Fixed Point Property
• The Strong Convergence of the Exponential Function

This page was built for publication: Semi-effective numberings and definitions of the computable numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5569449)