Theory of Recursive Functions and Effective Computability.

Keywords

Computability, Computability theory, Mathematics, μ operator, Computer science

References

No references recorded for this paper.

Cited by

• Computability and fractal dimensionJan Reimann — 2004
• Comparing Algebraic Structures up to Algorithmic EquivalenceDenis J. Kfoury — 1972
• On the Recursive Enumerability of Fixed-Point CombinatorsMayer Goldberg — 2004
• Higher order logicDaniël Leivant — 1994
• Science at the Crossroad Between Randomness and DeterminismKarl Svozil — 2000
• Neural Computation and the Computational Theory of CognitionНиконова Антонина Александровна, Окорокова Арина Сергеевна — 2013
• Real-time Decision Making For Shipboard Damage ControlVadim Bulitko, David Wilkins — 2002
• Learning Programs with an Easy to Calculate Set of ErrorsWilliam Gasarch, Ramesh K. Sitaraman, Carl H. Smith — 1988
• Novelty And Surprises In Complex Adaptive System (CAS) Dynamics: A Computational Theory of Actor InnovationSheri M. Markose — 2004
• On the Power of Model Theory in Specifying Abstract Data Types and in Capturing Their RecursivenessAlberto Bertoni, Giancarlo Mauri, Pierangelo Miglioli — 1983
• Incomplete property checking for asynchronous reactive systemsWei Wei — 2008
• The Set of Probabilistic Algorithmic Formulas Valid in a Finite Structure Is Decidable with Respect to Its DiagramWiktor Dańko — 1993
• Intertranslatability results for abstract argumentation semanticsChristof Spanring — 2012
• Design and Analysis of Randomized Algorithms - Introduction to Design ParadigmsJuraj Hromkovič — 2010
• A characterization of the hyperarithmetical sets in the language of ramified analysis.Reginald Clarke Handford — 1971
• Consciousness-Based Education: A Foundation for Teaching and Learning in the Academic DisciplinesDara Llewellyn, Craig Pearson — 2011
• Model Checking One Million Lines of C CodeHao Chen, Drew Dean, David Wagner — 2004
• Independent Instances for Some Undecidable ProblemsCristian S. Calude, Gheorghe Pǎun — 1983
• Computable Real Functions: Type 1 Computability Versus Type 2 ComputabilityPeter Hertling — 1996
• Two models for combinatory logicLuis E. Sanchis — 1975

Related papers

• Computability: An Introduction to Recursive Function TheoryNigel J. Cutland — 1980
• Uniformly reflexive structures: On the nature of gödelizations and relative computabilityEric G. Wagner — 1969