Notes Folio
n140401
Pursuing Generality
|
|
Notes Folio
n140401 |
| Status | Date | Description | |
| 2017-09-26 | Need to align on CT-effective and Turing-complete. There are definitions of these all over the place and we want to be very clear what we mean by them. Soare appears to have useful information in the Part I of his Computability Theory and Appplications:Volume 1, The Art of Classical Computability. | ||
| 2014-04-27 | computable Ob: It is important that the Obs be distinguishable. That is, there is a procedure for determining when two Obs are the same or different. This is a very strong condition. It has to do with the computationally-determined Obs. Since individual Obs are finite, they are always distinguishable. Being computationally-determined is not an observation about Obs as about application of procedures on Obs yet there are procedures that are not effective. This is different than there being functions on Obs that are not computable. | ||
| 2014-04-26 | denumerable Ob: It is easy to show that the Obs are denumerable. To show that they are not finite, we show that the set of Obs is recursive and that there is a progression by which no Ob-composing function ever produces one of its operands or any of their predecessors. | ||
|
done 2014-04-27 |
2014-04-26 | n140401: Share to the hosted-site mirror and publish to the site | |
|
done 2014-04-27 |
2014-04-26 | n140401: Add to n000001 with the appropriate title | |
|
done 2014-04-27 |
2014-04-26 | n140401: Customize as a folio title page, version 0.01 | |
|
done 2014-04-27 |
2014-04-26 | n140401a: Collect work items on this topic from OneNote, n000000, and my notebooks | |
|
done 2014-04-27 |
2014-04-26 | n140401c: Create a version progression block. | |
|
done 2014-04-27 |
2014-04-26 | n140401c: Customize as a folio page, version 0.00 | |
| done | 2014-04-26 | Customize n140401a and n140401b for the new location, styles, and formatting | |
| done | 2014-04-26 |
|
 |
|
created 2014-04-26-19:31 -0700 (pdt) by
orcmid |