Computability and Logic George S. Boolos, John P. Burgess, Richard C. Jeffrey
Publisher: Cambridge University Press

Jeffrey Language: English Page: 297. My review of Computability and Logic: 5th Edition. Symbolic Logic}, FJOURNAL = {The Journal of Symbolic Logic}, VOLUME = {65}, YEAR = {2000}, NUMBER = {2}, PAGES = {567--604}, We extend in a natural way the operation of Turing machines to infinite ordinal time, and investigate the resulting supertask theory of computability and decidability on the reals. Publisher: Cambridge University Press. This book studies fundamental interactions between proof theory and computability. Peano Arithmetic) on Computability Logic instead of the more traditional alternatives, such as Classical or Intuitionistic Logics. I am not sure if the step of writing it as a computable function is a first good attempt. It provides a unique self-contained text for advanced students and researchers in mathematical logic and computer science. But I need help in translating it to a program. Ii) Do you think "$x$ is prime" is decidable? @article {HamkinsLewis2000:InfiniteTimeTM, AUTHOR = {Hamkins, Joel David and Lewis, Andy}, TITLE = {Infinite time {T}uring machines}, JOURNAL = {J. Of basing applied theories (e.g. $qt(y,x+1) = qt(y,x) + sg(|x-(rm(y,x)+1)|)$. Computability and Logic George Boolos, Richard C. ISBN: 0521234794, 9780521234795. John Burgess, the only surviving author has an errata page. (End of prediction.) Computability logic … is a recently launched program for redeveloping logic as a formal theory of computability, as opposed to the formal theory of truth that logic has more traditionally been. By Boolos, Jeffrey and Burgess, here. For a discussion on IF, and Introduction to computability logic for an introduction to another project that builds logic of computation.