Mathematics – Logic
Scientific paper
1998-04-15
Mathematics
Logic
9 pages, no pictures, AMS latex
Scientific paper
Can a computer which runs for time $\omega^2$ compute more than one which
runs for time $\omega$? No. Not, at least, for the infinite computer we
describe. Our computer gets more powerful when the set of its steps gets
larger. We prove that they theory of second order arithmetic cannot be decided
by computers running to countable time.
No associations
LandOfFree
Ordinal computers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Ordinal computers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Ordinal computers will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-634775