scientific article; zbMATH DE number 3066801
From MaRDI portal
Publication:5805955
zbMath0043.24802MaRDI QIDQ5805955
Publication date: 1951
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (26)
Primitive recursive real numbers ⋮ Computable reducibility of metrics on the reals ⋮ Book review of: E. G. Omodeo (ed.) and A. Policriti (ed.), Martin Davis on computability, computational logic, and mathematical foundations ⋮ Generation of invertible functions ⋮ Kolmogorov and mathematical logic ⋮ Computable irrational numbers with representations of surprising complexity ⋮ On the hierarchy and extension of monotonically computable real numbers. ⋮ Computability and Recursion ⋮ NOMINALISTIC ORDINALS, RECURSION ON HIGHER TYPES, AND FINITISM ⋮ Weakly computable real numbers ⋮ Primitive Recursiveness of Real Numbers under Different Representations ⋮ Primitive recursion in the abstract ⋮ Criteria of constructibility for real numbers ⋮ Rekursive reelle Zahlen ⋮ Translating recursion equations into flow charts ⋮ On the generative power of transformational grammars ⋮ An enumeration of the primitive recursive functions without repetition ⋮ Reducing Ordinal Recursion ⋮ On a Subrecursive Hierarchy and Primitive Recursive Degrees ⋮ Discrete parabolas and circles on 2D cellular automata ⋮ The Developments of the Concept of Machine Computability from 1936 to the 1960s ⋮ Proof of a Conjecture of Routledge ⋮ Using PVS to validate the algorithms of an exact arithmetic. ⋮ Some thoughts on computational models: from massive human computing to abstract state machines, and beyond ⋮ Péter on Church's thesis, constructivity and computers ⋮ Divergence bounded computable real numbers
This page was built for publication:
