Theory of recursive functions and effective computabilityHartley Rogers

Theory of recursive functions and effective computability

by Hartley Rogers · first published 1957

3mentions
1recommended by
3HN commenters
2009–2026first – last mentioned

33% recommend67% neutral

Affiliate links. As an Amazon Associate I earn from qualifying purchases.

Mentions per year

10 2007: 0 mentions2008: 0 mentions2009: 1 mention2010: 0 mentions2011: 0 mentions2012: 0 mentions2013: 0 mentions2014: 0 mentions2015: 0 mentions2016: 0 mentions2017: 0 mentions2018: 0 mentions2019: 0 mentions2020: 0 mentions2021: 1 mention2022: 0 mentions2023: 0 mentions2024: 0 mentions2025: 0 mentions2026: 1 mention200720172026

What Hacker News says

  • paulreiners · Jun 19, 2009 · Recommends

    "Theory of Recursive Functions and Effective Computability" by Hartley Rogers is excellent.

    on “Ask HN: good math books” ↗
  • …would someone choose to implement the lambda calculus on bare-metal? You call it "fetishism," I call it fun! More generally, I just really like the idea of having a machine with a user-writable ISA. [1] Theory of Recursive Functions and Effective Computability: https://openlibrary.org/books/OL2738948M/Theory_of_recursive... [2] Introduction to Lambda Calculus: https://www.cse.chalmers.se/research/group/logic/TypesSS05/E...

    on “Turing Oversold?” ↗
  • qsort · Jul 21, 2026 · Mentions

    Rogers "Theory of Recursive Functions and Effective Computability", page 1, emphasis is the author's: § 1.1 The informal notion of algorithm In this chapter we give a formal (i.e., mathematically exact) characterization of recursive function. The concept is basic…

    on “Claude Is Not a Compiler” ↗

Keyboard shortcuts

/
Focus search
j / k
Next / previous book
Enter
Open focused book
Esc
Close / go back
g h
Go to Home
g t
Go to Top all-time
g m
Go to Most recommended
g r
Go to Rising
g f
Go to For You
?
Show this help