Results 41 to 50 of about 793,130 (202)

On Splitting an Infinite Recursively Enumerable Class

open access: yes, 1975
By an RE (recursively enumerable) sequence we mean a sequence V(0), V(1), … of uniformly RE sets, denotes the class of all RE sets. If is an RE class if either for some RE sequence V(0), V(1) , … .
J. B. Florence
core   +1 more source

Developing a critical caste analysis within information science and technology: A research review: An Annual Review of Information Science and Technology (ARIST) paper

open access: yesJournal of the Association for Information Science and Technology, EarlyView.
Abstract Caste—an ascriptive social hierarchy in South Asia and its diaspora—is a globalized phenomenon. Recent caste‐based discrimination, particularly in technology companies and anti‐caste efforts to address it, has compelled academia, policy, and the technology industry to better understand contemporary mechanics of caste.
Nayana Kirasur, Britt Paris
wiley   +1 more source

The ultimate forgery: A semiotic deconstruction of large language models as engines of simulated selfhood

open access: yesJournal of the Association for Information Science and Technology, EarlyView.
Abstract Information science rests on a compact: its mediating signs maintain a traceable relation to what they describe. Large language models (LLMs) break it architecturally, generating discourse that is statistically plausible yet epistemically ungrounded, while standard metrics (precision, recall, relevance) cannot detect the rupture.
Martin Thellefsen, Alon Friedman
wiley   +1 more source

Almost recursively enumerable sets

open access: yes, 1972
An injective function on N, the nonnegative integers, taking values in N, is called almost recursive (abbreviated a.r.) if its inverse has a partial recursive extension. The range of an a.r.
John W. Berry
core   +1 more source

Did AI win after all?

open access: yesJournal of the Association for Information Science and Technology, EarlyView.
Abstract Algorithmic platforms are reshaping how people work and how human activity is rendered intelligible within data‐intensive systems. This paper argues that Heidegger's philosophy of technology, specifically Ge‐stell (enframing) and Poiesis (bringing‐forth), offers information science a conceptual vocabulary for understanding both algorithmic ...
Fred Fonseca
wiley   +1 more source

Difference Splittings of Recursively Enumerable Sets

open access: yes, 1997
We study here the degree-theoretic structure of set-theoretical splittings of recursively enumerable (r.e.) sets into differences of r.e. sets. As a corollary we deduce that the odering of wtt-degrees of unsolvability of differences of r.e. sets is not a
Arslanov, Asat, Arslanov,Asat
core   +1 more source

A repertoire of middle leading practices: A large‐scale investigation of middle leadership in schools

open access: yesBritish Educational Research Journal, EarlyView.
Abstract This article presents findings from an Australian study investigating the practices of middle leaders responsible for facilitating school development. Despite middle leaders being increasingly recognised as essential in the development of teaching and learning in schools, middle leadership remains under‐researched and comparatively overlooked ...
Peter Grootenboer   +3 more
wiley   +1 more source

The epistemic ceiling: Veteran practitioners' perspectives on primary qualification entry standards for teaching secondary mathematics in Scotland

open access: yesBritish Educational Research Journal, EarlyView.
Abstract This paper presents an exploratory analysis of contemporary curricular and professional qualification policies in the Scottish education system, focusing on minimum qualification thresholds for mathematics teaching. The study examines how veteran secondary mathematics practitioners perceive the structural and pedagogical implications of using ...
Paul Argyle McDonald
wiley   +1 more source

Very special languages and representations of recursively enumerable languages via computation histories

open access: yesInformation and Control, 1980
A method of encoding the computation histories of a wide class of machines is introduced and used to derive several representation theorems for the class of recursively enumerable languages. In particular it is demonstrated that any recursively enumerable language K ⊂ Σ* can be represented as K = ΦΣ(R ∩ D1 ⋮ D2), where D1 and D2 are fixed semi-Dyck ...
David Haussler, H. Paul Zeiger
openaire   +1 more source

Widening participation and the changing risks of higher education: Working‐class women's pathways via access courses across two decades

open access: yesBritish Educational Research Journal, EarlyView.
Abstract Widening participation (WP) in higher education (HE) remains a central concern within UK educational and social policy. It seeks to address the underrepresentation of specific social groups by tailoring university access to their distinct needs.
Sarah McLaughlin, Richard Waller
wiley   +1 more source

Home - About - Disclaimer - Privacy