User contributions
Jump to navigation
Jump to search
- 18:15, 5 August 2006 diff hist +125 m Mathematics Link to Algorithmic information theory, with short text
- 17:58, 5 August 2006 diff hist -1 m Algorithmic information theory small rephrasing
- 17:57, 5 August 2006 diff hist +178 Algorithmic information theory (1): A link back to Chaitin's construction, (2): some introductory text annoting Chaitin's writings
- 17:52, 5 August 2006 diff hist +47 m Algorithmic information theory Adding (yet invisible) table of contents, and categorizing as Category:Theoretical foundations
- 17:50, 5 August 2006 diff hist +265 N Algorithmic information theory Wikipedia links and Chaitin's homepage
- 17:20, 5 August 2006 diff hist +44 m Chaitin's construction →Introduction: Initiating new page Algorithmic information theory
- 15:19, 5 August 2006 diff hist -15 m Chaitin's construction →More natural norm functions (from CL terms): Doing the same for another occurrence of the same mistake
- 15:17, 5 August 2006 diff hist -14 m Chaitin's construction Sign of ``identical as terms'' is inapprorate at defining a funtion (norm). Also a misstyping is corrected
- 15:10, 5 August 2006 diff hist +336 Chaitin's construction (1): Writing new subsection →Architecture: for section →Implementation: , (2): inserting new headline →User interface: before the bash examples
- 14:59, 5 August 2006 diff hist +4 m Chaitin's construction ``norm function OF ...'' is disambigous here, using ``FROM '' instead
- 14:57, 5 August 2006 diff hist +200 m Chaitin's construction →To do: points to →Implementation: and newly moved →More natural norm functions (from CL terms
- 14:45, 5 August 2006 diff hist +509 Chaitin's construction →To do: Explaining analogy between Mandelbrot softwares making conjectures on convergence and this program making conjecture on termination
- 13:39, 5 August 2006 diff hist +113 m Chaitin's construction →To do: Extending usage examples, and better option name
- 14:43, 4 August 2006 diff hist +33 Chaitin's construction →Implementation: Better section hierarchy
- 14:40, 4 August 2006 diff hist +241 Chaitin's construction Also this page refers to combinatory logic term modules. That was why I made a separate page for it (two references are enough for that)
- 14:34, 4 August 2006 diff hist +47 m Chaitin's construction/Combinatory logic table of contents and categorising under Category:Theoretical foundations current
- 14:33, 4 August 2006 diff hist +642 N Chaitin's construction/Combinatory logic Lifting section hierarchy
- 14:31, 4 August 2006 diff hist -555 Chaitin's construction/Parser Moving combinatory logic term modules to a separate pege current
- 14:21, 4 August 2006 diff hist +52 m Chaitin's construction Grammatical and typographic corrections
- 14:13, 4 August 2006 diff hist +322 Chaitin's construction →3 Eliminating any concept of code by handling combinatory logic terms direct: Clarifying the aim of this chapter
- 14:00, 4 August 2006 diff hist +2,154 Chaitin's construction Defining concept which do not use the notion of ``code''
- 13:11, 4 August 2006 diff hist +1,691 Chaitin's construction/Parser Moving text and modifying section hierarchy. Mentioning term generators
- 12:47, 4 August 2006 diff hist -1,004 Chaitin's construction Also other details go to the separate Chaitin's construction/Parser page
- 12:44, 4 August 2006 diff hist +2,699 N Chaitin's construction/Parser Receiving contents from the mentioned page, and adjusting its section hierarchy
- 12:41, 4 August 2006 diff hist -2,522 Chaitin's construction Not so important details come to a new Chaitin's construction/Parser page. Parsers are not necessary here, a good generator is enough
- 22:57, 3 August 2006 diff hist +17 m Chaitin's construction →Decoding: Changing term ``arrow parsers'' into a link to Arrow#Parser
- 22:43, 3 August 2006 diff hist +26 Chaitin's construction ``neverfailing'' is a better name for the combinator on parsers, which makes ``decode'' function total
- 22:26, 3 August 2006 diff hist +309 Chaitin's construction →Decoding: Referring to paper Monadic Parser Combinators, credit to Graham Hutton and Erik Meier
- 22:07, 3 August 2006 diff hist +4 m Chaitin's construction binding after parser |item|
- 22:02, 3 August 2006 diff hist +5 m Chaitin's construction rephrasing
- 21:59, 3 August 2006 diff hist +17 m Chaitin's construction LL(1) grammar, not LL(0)
- 21:51, 3 August 2006 diff hist +263 Chaitin's construction →Decoding: More clear distinction between LL(k) parser and LL(k) grammar
- 21:29, 3 August 2006 diff hist +24 m Chaitin's construction typographic corrections, rephrasings
- 21:10, 3 August 2006 diff hist +680 Chaitin's construction Rephrasings, annotations, and code examples for partial function approach and total function approach
- 17:29, 3 August 2006 diff hist 0 m Chaitin's construction Reaneming >>^ to >>@ (in the sense of liftM2 apply), because arrows use also symbol >>^ in another sense (p >>^ f = p >>> arr f)
- 17:11, 3 August 2006 diff hist +46 m Chaitin's construction Small rephrasing of headlines
- 17:06, 3 August 2006 diff hist +26 m Chaitin's construction Small corrections
- 17:02, 3 August 2006 diff hist +127 m Chaitin's construction Fixing import/export lists of modules
- 16:48, 3 August 2006 diff hist +1,825 Chaitin's construction Defining decode function in Haskell
- 14:01, 3 August 2006 diff hist +4 m Chaitin's construction Putting verb in a sentence which consisted only of a huge noun phrase
- 13:53, 3 August 2006 diff hist +3 m Chaitin's construction Spell-check with ispell
- 13:46, 3 August 2006 diff hist -13 m Chaitin's construction No indenting for bash code
- 13:39, 3 August 2006 diff hist +45 Combinatory logic →Applications: Referring to Chaitin's construction, which can show why combinatory logic can be important in other areas of mathematics
- 13:32, 3 August 2006 diff hist +154 Chaitin's construction →Basing it on combinatory logic: Formula, that range of coding function equals to domain of decoding function
- 13:19, 3 August 2006 diff hist +419 Chaitin's construction →To do: Writing software for making conjectures in this topic
- 11:45, 3 August 2006 diff hist +189 m Chaitin's construction →Introduction: Writing an introductory text -- asking the motivating question of the topic
- 11:39, 3 August 2006 diff hist +50 m Chaitin's construction The set of syntactiaclly correct bitstring codings of combinatory logic is exactly both the domain of decoding and range of coding function
- 11:28, 3 August 2006 diff hist 0 m Chaitin's construction I had confused e.g. (exempla gratia) with i.e. (idem esse). Now I have corrected it
- 11:23, 3 August 2006 diff hist +8 m Chaitin's construction Some rephrasing
- 11:13, 3 August 2006 diff hist +2,454 N Chaitin's construction Having moved here from Exact real arithmetic. Making sections (→Introduction: , →Basing it on combinatory logic: ). Adding new sec →Related concepts: , linking back to Exact real arithmetic