- From: Guntur Wiseno Putra <gsenopu@gmail.com>
- Date: Sun, 8 Dec 2019 14:51:56 +0700
- To: Steven Pemberton <steven.pemberton@cwi.nl>
- Cc: XForms <public-xformsusers@w3.org>
- Message-ID: <CAKi_AEsMxk38HBS=3QXKa5shfMhk9ZP3kheXy9fyySk9HpCT-g@mail.gmail.com>
Dear Steven & public-xformsusers, I finded words on declarative languages and the Turing Complete in "Principle of Least Power", a section of the "Principles of Design" by Tim Berner-Lee (1998; last changed 2013) explaining about picking the least powerful languages...: https://www.w3.org/DesignIssues/Principles.html Regard, Guntur Wiseno Putra Pada Minggu, 08 Desember 2019, Guntur Wiseno Putra <gsenopu@gmail.com> menulis: > Dear Steven & public-xformsusers, > > I finded words on declarative languages and the Turing Complete in > "Principle of Least Power", a section of the "Principles of Design" (1998; > last changed 2013) explaining about picking the least powerful languages...: > > > https://www.w3.org/DesignIssues/Principles.html > > Regard, > Guntur Wiseno Putra > > Pada Sabtu, 07 Desember 2019, Guntur Wiseno Putra <gsenopu@gmail.com> > menulis: > >> Dear Steven and public-xformsusers, >> >> At least until your talk on MarkupUK it is said about xformsusers as a >> Turing-complete model: >> >> https://homepages.cwi.nl/~steven/Talks/2019/06-07-markup/ >> >> Opening pages on XML and I finded one titled "Evolvability" written by T. >> Berner-Lee (2009): In attempting interoperability and >> evolution/evolvability as two main goals of all W3C technologies, there was >> discussed an option of schema documents, which was shema option 5: >> Turing-complete language recipe for conversion into other languages: >> There were said about a balance between declarative language whose >> formulae easily manipulated and powerful programming languages whose >> programmes have to be left to see what they do, filters, and language >> conversion from XML... >> >> https://www.w3.org/DesignIssues/Evolution.html >> >> If there are such differences, such histories, of the understanding on >> Turibg -complete model in relation with XForms...? --knowledges may be >> helpful to learn on the programming language...? >> >> Regard, >> Guntur Wiseno Putra >> >> >> >> >> Pada Sabtu, 25 Mei 2019, Guntur Wiseno Putra <gsenopu@gmail.com> menulis: >> >>> Dear All, >>> >>> The Spectrum-IEEE's article on Alan Turing sugested a link to "Computing >>> Machinery and Intellegence" >>> >>> https://www.csee.umbc.edu/courses/471/papers/turing.pdf >>> >>> There are also other papers on Turing (Test) worked on at least by >>> Saygin A.P et all., Hutchens J.L. (either alone or et all), Hayes, P et >>> all... >>> >>> >>> https://www.csee.umbc.edu/courses/471/papers/ >>> >>> >>> (Those resources above are maintained by the University of Maryland >>> Baltimore County Department of Computer Science and Electrical Engineering.) >>> >>> >>> Regard, >>> Guntur Wiseno Putra >>> >>> Pada Jumat, 24 Mei 2019, Guntur Wiseno Putra <gsenopu@gmail.com> >>> menulis: >>> >>>> >>>> Dear All, >>>> >>>> >>>> It comes from 2018 "MarkupUK"'s proceeding "XForms 2.0 Test Suite" >>>> saying about the birth of XForms 1.1 as a declarative, Turing-complete >>>> programming language. >>>> >>>> https://markupuk.org/webhelp/index_frames.html >>>> >>>> >>>> Recently there was a history on Alan Turing >>>> "Untold History of AI: Why Alan Turing Wanted AI Agents to Make >>>> Mistakes" (Schwartz, O., Spectrum- IEEE, April1st 2019) >>>> >>>> >>>> https://spectrum.ieee.org/tech-talk/tech-history/dawn-of-ele >>>> ctronics/untold-history-of-ai-why-alan-turing-wanted-ai-to-m >>>> ake-mistakes >>>> >>>> >>>> Regard, >>>> Guntur Wiseno Putra >>>> >>>> >>>> Pada Selasa, 21 Mei 2019, Steven Pemberton <steven.pemberton@cwi.nl> >>>> menulis: >>>> >>>>> Also worth pointing out that there are two XForms sessions at MarkupUK >>>>> as well: >>>>> >>>>> Declarative Applications with XForms >>>>> Steven Pemberton >>>>> >>>>> XQuery for Data Workers >>>>> Alain Couthures >>>>> >>>>> Steven >>>>> >>>>>
Received on Sunday, 8 December 2019 07:51:59 UTC