The Miser Project

CT: Computation Theory
Diary & Job Jar

miser>
ct>

 

c000000>
2024-01-14 -09:41 -0800

Status

Date

Description

done
2024-01-03
2023-11-11


The Construction and Content Material here was created in conformance with the 2023-11-04 style and location requirements of the
Site Refactoring/Preservation Project.  Check that folder for additional details of the approach to correction and upgrade.

 
     
     
     
     
     
  2024-01-13 There needs to be a folio on just what is now called Church-Turing Completeness/Computability, whatever.  Dig it all out.  I have references and sources aplenty.  https://en.wikipedia.org/wiki/Church%E2%80%93Turing_thesis is a nice account.
  2024-01-03 The treatment of speedups/accelerators will be relevant with regard to the overall complexity of operation.  The comparison and typing operations should be valuable, as will some others.  Reducing linear search/constructions will be more problematic, except perhaps inside procs.
  2024-01-02 A bibliography and history with references will be needed, even if the citations are also in orcmid.github.io/bib.  There might be shared/bilateral articles, for that matter.
  2024-01-02 I'm uncertain how Chaitin's "LISP" can be emulated in oMiser to the extent that the claimed limitation and AIT are demonstrated. 
  2024-01-02  It is also important to count ap or maybe ev operations.  We then need to look at speed-ups, especially with regard to comparison operations.  Because the discriminators are always rapid they don't fall into the general complexity of comparison discrimination, because the self-pointer cases are immediately established, even if done "long-hand" although it might be worthwhile to have such operations be explicit. [dh:2024-01-13: Finding accelerators for those would be interesting, and it would also be interesting to see how they are found and able to be replaced/JITted.]
  2024-01-02 With regard to computational complexity we need to find a means of establishing time and perhaps storage (in some sense) with respect to oMiser computation.  It is important to count ob.c operations.  This is not quite a storage requirement, but there is a storage cost.  There needs to be a distinction between how much storage is required at a maximum as opposed to how many cells are created over time.
  2024-01-02 Feature limited coverage of the Church-Turing Thesis and how we establish that the ‹ob› structure is adequate and equivalent to the cases that are recognized as having the same power.  
done
2024-01-14
2024-01-13 index.html: Fix the Catalog heading to use ct instead of cs.
done
2024-01-13
2024-01-02 index.md: Insert Hybrid Placeholder
done 2024-01-05 construction.htm: Fix links in local zone structure
done 2024-01-03 Make the Construction Zone tidy enough so that the c000000 and construction.htm serve as boilerplate for subsequent (alphabetical) topics.
     
Construction Structure (Hard Hat Area) You are navigating construction material
of the Miser Project

created 2023-11-12T04:15Z by orcmid