1,664 research outputs found
The Stranger in the Woods
No full textAn excerpt from Michael Finkel\u27s book, The Stranger in the Woods: the Extraordinary Story of the Last True Hermit, is featured, along with an interview of the author. Finkel\u27s book is the story of Christopher Knight, locally know at the North Pond Hermit, who lived alone in the woods for 27 years until he was apprehended by police for robbery charges. [illustration, images
Classical and effective descriptive complexities of ω-powers
No full textAbstractWe prove that, for each countable ordinal ξ≥1, there exist some Σξ0-complete ω-powers, and some Πξ0-complete ω-powers, extending previous works on the topological complexity of ω-powers [O. Finkel, Topological properties of omega context free languages, Theoretical Computer Science 262 (1–2) (2001) 669–697; O. Finkel, Borel hierarchy and omega context free languages, Theoretical Computer Science 290 (3) (2003) 1385–1405; O. Finkel, An omega-power of a finitary language which is a borel set of infinite rank, Fundamenta informaticae 62 (3–4) (2004) 333–342; D. Lecomte, Sur les ensembles de phrases infinies constructibles a partir d’un dictionnaire sur un alphabet fini, Séminaire d’Initiation a l’Analyse, 1, année 2001–2002; D. Lecomte, Omega-powers and descriptive set theory, Journal of Symbolic Logic 70 (4) (2005) 1210–1232; J. Duparc, O. Finkel, An ω-Power of a Context-Free Language Which Is Borel Above Δω0, in: S. Bold, B. Löwe, T. Räsch, J. van Benthem (Eds.), in the Proceedings of the international conference foundations of the formal sciences V : Infinite Games, November 26th to 29th, 2004, Bonn, Germany, in: Studies in Logic, vol. 11, College Publications at King’s College, 2007, pp. 109–122]. We prove effective versions of these results; in particular, for each recursive ordinal ξ<ω1CK there exist some recursive sets A⊆2<ω such that A∞∈Πξ0∖Σξ0 (respectively, A∞∈Σξ0∖Πξ0), where Πξ0 and Σξ0 denote classes of the hyperarithmetical hierarchy. To do this, we prove effective versions of a result by Kuratowski, describing a Πξ0 set as the range of a closed subset of the Baire space ωω by a continuous bijection. This leads us to prove closure properties for the pointclasses Σξ0 in arbitrary recursively presented Polish spaces. We apply our existence results to get better computations of the topological complexity of some sets of dictionaries considered in [D. Lecomte, Omega-powers and descriptive set theory, Journal of Symbolic Logic 70 (4) (2005) 1210–1232]
Corrigendum to “Assessing disease progression in Spinal Muscular Atrophy, current gaps, and opportunities: a narrative review” [NMD, volume 49, article 105341] (Neuromuscular Disorders (2025) 49, (S0960896625000689), (10.1016/j.nmd.2025.105341))
No full textThe authors regret that the originally listed affiliation for Dr Richard Finkel is incorrect in the original publication. The authors would like to apologise for any inconvenience caused
Addressing Atrocity Crimes: The American Experience
No full textPresentation: Mr. James Finkel
Discussants: Professor Amy Gaudion, Dickison Law; Professor Anne Toomey McKenna, Dickinson Law; Professor Kris Wheaton, US Army War Colleg
Addressing Atrocity Crimes: The American Experience
No full textPresentation: Mr. James Finkel
Discussants: Professor Amy Gaudion, Dickison Law; Professor Anne Toomey McKenna, Dickinson Law; Professor Kris Wheaton, US Army War Colleg
Addressing Atrocity Crimes: The American Experience
No full textPresentation: Mr. James Finkel
Discussants: Professor Amy Gaudion, Dickison Law; Professor Anne Toomey McKenna, Dickinson Law; Professor Kris Wheaton, US Army War Colleg
Recommended from our members
Networking Past and Present
No full textA special feature in the Social Evolution Forum with R.I.M. Dunbar as the author of the focus article. Commentaries by Nicolas Baumard, Marcus J. Hamilton, Paul Hooper, Daniel N. Finkel, and Herbert Gintis
Comments on moderate alcohol consumption and mortality
No full textAbstract not availableElizabeth Barrett-Connor, Giovanni de Gaetano, Luc Djoussé, Curtis Ellison, Ramon Estruch, Harvey Finkel, Tedd Goldfinger, Ulrich Keil, Dominique Lanzmann-Petithory, Fulvio Mattivi, Erik Skovenborg, Creina Stockley, Arne Svilaas, Pierre-Louis Teissedre, Dag S. Thelle, Fulvio Ursini, Andrew L. Waterhous
The Evliya Celebi Way: Turkey's First Long-distance Walking and Riding Route
No full textThis is the guidebook to Turkey's new long-distance Cultural Route, complete with route description, map, historical background, and places to see. The route follows the Ottoman gentleman adventurer Evliya Celibi on his way to Mecca in 1671; it runs for 600km from the Sea of Marmara via Bursa, Kutahya and Afyon to Usak and Simav. The route follows, as far as possible, ancient paved roads and visits the cities, sights and tiny villages that Evliya rode through and recorded in his "Seyatname" ("Book of Travels"). It can be explored by walkers, horse-riders and bikers. The UN has declared Evliya 'Man of the Year' for 2011, the 400th anniversary of his birth. This route is a practical addition to these celebrations - it enables modern travellers to directly experience Evliya's life, times and travels. It is brought to you by the noted Ottoman historian and author of "Osman's Dream", Caroline Finkel, and the originator of 'The Lycian Way', Kate Clow
Computing in the field: language modeling for elicitation and documentation of Shughni
No full textWe propose a way of enhancing computer-based approaches to language documentation by making use not only of the engineering capability of computing but also its modeling capacity. Our proposal arises from a documentation pilot project where we used computational modeling as an elicitation tool for documenting the complex verbal morphology of the underdocumented East Iranian Pamir language Shughni. Using the computable lexical knowledge representation language DATR (Evans & Gazdar 1996) and its variant KATR (Author et al. 2002), we wrote a theory of a fragment of the Shughni verb system based on what little we knew about the language. We then presented its theorem to our group of Shughni consultants, and based on their responses refined the model, and then consulted them on the new theorem, and so on to the next refinement. Cycling through these steps allowed us to refine our model and so lead to a more accurate account of the data. Equally importantly, this method gave us an automated ‘questionnaire generator’, i.e. the model's theorem. This provided not only elicitation queries that, given enough time, we may have thought of ourselves but those which may never have occurred to us. Both types of query were available to us precisely because our understanding of the grammar was formal and computationally implemented, and could thereby automatically generate theorems. Computing plays a key language engineering role in language documentation and its accessibility to the wider audience, from standard mark-up of data to its storage in a relational database for query-based retrieval. But computing serves a second purpose for linguists, that of language modeling: this is “the instrumental use of computation in the pursuit of linguistic goals” (Thompson 1983: 23). As we develop new methods for documentation, we need to explore the possibility of harnessing this other language modeling capacity of computing. We demonstrate through our work on Shughni that computer modeling can be a means of furnishing the field-worker with elicitation tasks whose results feed into an enhanced understanding of the data, which in turn show the path to the next stage of elicitation, ultimately leading to a well-informed and robust account of the data which is already digitized and therefore exchangeable. Advances in technology, such as palm-held computers, mean that an automated model-theorem-refinement method is both a practical and potentially highly valuable addition to the field-worker’s toolkit, both while in the field and back in the lab
- …
