Results 91 to 100 of about 134,383 (239)

About Shannon's problem for turing machines [PDF]

Computer Science Journal of Moldova, 1993
Describe the universal turing machine with 3 states and 10 symbols and with 27 commands really used in the program.
Yu. Rogozhin
doaj  

Language machines: Toward a linguistic anthropology of large language models

Journal of Linguistic Anthropology, Volume 36, Issue 1, May 2026.
Abstract Large language models (LLMs) challenge long‐standing assumptions in linguistics and linguistic anthropology by generating human‐like language without relying on rule‐based structures. This introduction to the special issue Language Machines calls for renewed engagement with LLMs as socially embedded language technologies.
Siri Lamoureaux, Michael Castelle, Anna Weichselbraun   +2 more
wiley   +1 more source

Human tests for machine models: What lies “Beyond the Imitation Game”?

Journal of Linguistic Anthropology, Volume 36, Issue 1, May 2026.
Abstract Benchmarking large language models (LLMs) is a key practice for evaluating their capabilities and risks. This paper considers the development of “BIG Bench,” a crowdsourced benchmark designed to test LLMs “Beyond the Imitation Game.” Drawing on linguistic anthropological and ethnographic analysis of the project's GitHub repository, we examine ...
Noya Kohavi, Anna Weichselbraun
wiley   +1 more source

Single-tape and Multi-tape Turing machines through the lens of the\n Grossone methodology [PDF]

, 2013
Yaroslav D. Sergeyev, Alfredo Garro
openalex   +1 more source

Co‐textual dopes: How LLMs produce contextually appropriate text in chat interactions with humans without access to context

Journal of Linguistic Anthropology, Volume 36, Issue 1, May 2026.
Abstract This paper asks how LLM‐based systems can produce text that is taken as contextually appropriate by humans without having seen text in its broader context. To understand how this is possible, context and co‐text have to be distinguished. Co‐text is input to LLMs during training and at inference as well as the primary resource of sense‐making ...
Ole Pütz
wiley   +1 more source

Quantum Random Self-Modifiable Computation

, 2019
Among the fundamental questions in computer science, at least two have a deep impact on mathematics. What can computation compute? How many steps does a computation require to solve an instance of the 3-SAT problem? Our work addresses the first question,
Fiske, Michael Stephen
core  

Formalization of the class of problems solvable by a nondeterministic Turing machine [PDF]

, 1999
Anatoly D. Plotnikov
openalex   +1 more source

The chatbot's real self: On the archaeology of artificial personas Le vrai soi du chatbot: vers une archéologie des personnes artificielles

Journal of Linguistic Anthropology, Volume 36, Issue 1, May 2026.
Abstract From the beginning of widespread public interactions with ChatGPT and other large language models, some users have seen the disfluencies of chatbots as opportunities for them to go on an archaeological search for an unfettered chatbot persona that they need to jailbreak. These are not claims of sentience, but rather of personhood.
Courtney Handman
wiley   +1 more source

A Universal Reversible Turing Machine that Directly Simulates Reversible Counter Machines [PDF]

Computer Science Journal of Moldova
We construct a 1-tape 98-state 10-symbol universal reversible Turing machine (URTM(98,10)) that directly simulates reversible counter machines (RCMs). The objective of this construction is not to minimize the numbers of states and tape symbols, but
Kenichi Morita
doaj   +1 more source

Simulating 3-symbol Turing machines with SIMD||DNA

, 2021
David Doty, Aaron Ong
openalex   +2 more sources