Relevant bibliographies by topics / Universal models of computation

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Universal models of computation'

Author: Grafiati
Published: 5 June 2025
Last updated: 1 August 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Universal models of computation.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Universal models of computation"

1

Wootton, James R., and Jiannis K. Pachos. "Universal Quantum Computation with Abelian Anyon Models." Electronic Notes in Theoretical Computer Science 270, no. 2 (2011): 209–18. http://dx.doi.org/10.1016/j.entcs.2011.01.032.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

De las Cuevas, Gemma, Wolfgang Dür, Maarten Van den Nest, and Hans J. Briegel. "Completeness of classical spin models and universal quantum computation." Journal of Statistical Mechanics: Theory and Experiment 2009, no. 07 (2009): P07001. http://dx.doi.org/10.1088/1742-5468/2009/07/p07001.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Šíma, Jiří, and Pekka Orponen. "Continuous-Time Symmetric Hopfield Nets Are Computationally Universal." Neural Computation 15, no. 3 (2003): 693–733. http://dx.doi.org/10.1162/089976603321192130.

Full text
Abstract:
We establish a fundamental result in the theory of computation by continuous-time dynamical systems by showing that systems corresponding to so-called continuous-time symmetric Hopfield nets are capable of general computation. As is well known, such networks have very constrained Lyapunov-function controlled dynamics. Nevertheless, we show that they are universal and efficient computational devices, in the sense that any convergent synchronous fully parallel computation by a recurrent network of n discrete-time binary neurons, with in general asymmetric coupling weights, can be simulated by a
APA, Harvard, Vancouver, ISO, and other styles
4

Campos, Marcelino, and José M. Sempere. "Generating networks of genetic processors." Genetic Programming and Evolvable Machines 23, no. 1 (2021): 133–55. http://dx.doi.org/10.1007/s10710-021-09423-7.

Full text
Abstract:
AbstractThe Networks of Genetic Processors (NGPs) are non-conventional models of computation based on genetic operations over strings, namely mutation and crossover operations as it was established in genetic algorithms. Initially, they have been proposed as acceptor machines which are decision problem solvers. In that case, it has been shown that they are universal computing models equivalent to Turing machines. In this work, we propose NGPs as enumeration devices and we analyze their computational power. First, we define the model and we propose its definition as parallel genetic algorithms.
APA, Harvard, Vancouver, ISO, and other styles
5

Suzuki, Ryotaro, Kosuke Mitarai, and Keisuke Fujii. "Computational power of one- and two-dimensional dual-unitary quantum circuits." Quantum 6 (January 24, 2022): 631. http://dx.doi.org/10.22331/q-2022-01-24-631.

Full text
Abstract:
Quantum circuits that are classically simulatable tell us when quantum computation becomes less powerful than or equivalent to classical computation. Such classically simulatable circuits are of importance because they illustrate what makes universal quantum computation different from classical computers. In this work, we propose a novel family of classically simulatable circuits by making use of dual-unitary quantum circuits (DUQCs), which have been recently investigated as exactly solvable models of non-equilibrium physics, and we characterize their computational power. Specifically, we inve
APA, Harvard, Vancouver, ISO, and other styles
6

Qu, Yipeng, and Joohee Kim. "Enhancing Query Formulation for Universal Image Segmentation." Sensors 24, no. 6 (2024): 1879. http://dx.doi.org/10.3390/s24061879.

Full text
Abstract:
Recent advancements in image segmentation have been notably driven by Vision Transformers. These transformer-based models offer one versatile network structure capable of handling a variety of segmentation tasks. Despite their effectiveness, the pursuit of enhanced capabilities often leads to more intricate architectures and greater computational demands. OneFormer has responded to these challenges by introducing a query-text contrastive learning strategy active during training only. However, this approach has not completely addressed the inefficiency issues in text generation and the contrast
APA, Harvard, Vancouver, ISO, and other styles
7

Shafahi, Ali, Mahyar Najibi, Zheng Xu, John Dickerson, Larry S. Davis, and Tom Goldstein. "Universal Adversarial Training." Proceedings of the AAAI Conference on Artificial Intelligence 34, no. 04 (2020): 5636–43. http://dx.doi.org/10.1609/aaai.v34i04.6017.

Full text
Abstract:
Standard adversarial attacks change the predicted class label of a selected image by adding specially tailored small perturbations to its pixels. In contrast, a universal perturbation is an update that can be added to any image in a broad class of images, while still changing the predicted class label. We study the efficient generation of universal adversarial perturbations, and also efficient methods for hardening networks to these attacks. We propose a simple optimization-based universal attack that reduces the top-1 accuracy of various network architectures on ImageNet to less than 20%, whi
APA, Harvard, Vancouver, ISO, and other styles
8

Ulyanov, Sergey, Andrey Reshetnikov, Olga Tyatyushkina, and Vladimir Korenkov. "Quantum software engineering. Pt. I: Quantum Circuit (Gate) Model based Computing – education Lectures and pedagogical workshop." System Analysis in Science and Education, no. 3 (2020) (September 30, 2020): 129–201. http://dx.doi.org/10.37005/2071-9612-2020-3-129-201.

Full text
Abstract:
All the quantum algorithms are based on a certain quantum computing model, varying from the quantum circuit, one-way quantum computation, adiabatic quantum computation and topological quantum computation. These four models are equivalent in computational power; among them, the quantum circuit model is most frequently used. In the circuit model, it has been proved that arbitrary single-qubit rotations plus twoqubit controlled-NOT gates are universal, i.e. they can provide a set of gates to implement any quantum algorithm. This article discusses the goal for this research: it is to given a light
APA, Harvard, Vancouver, ISO, and other styles
9

Lowder, Chris, Chris Gilly, and Craig DeForest. "Field Line Universal relaXer (FLUX): A Fluxon Approach to Coronal Magnetic Field Modeling." Astrophysical Journal 965, no. 1 (2024): 13. http://dx.doi.org/10.3847/1538-4357/ad2845.

Full text
Abstract:
Abstract We describe a novel method for modeling the global, steady solar wind using photospheric magnetic fields as a driving boundary condition. Prior wind models in this class include both rapid heuristic methods that use potential field extrapolation and variants thereof, trading rigor for computation speed, and detailed 3D magnetohydrodynamic (MHD) models that attempt to simulate the entire solar corona with a degree of physical rigor, but require large amounts of computation. The Field Line Universal relaXer, an open-source numerical code that implements the “fluxon” semi-Lagrangian appr
APA, Harvard, Vancouver, ISO, and other styles
10

Wu, Bujiao, Xiaoyang Wang, Xiao Yuan, Cupjin Huang, and Jianxin Chen. "Leakage Benchmarking for Universal Gate Sets." Entropy 26, no. 1 (2024): 71. http://dx.doi.org/10.3390/e26010071.

Full text
Abstract:
Errors are common issues in quantum computing platforms, among which leakage is one of the most-challenging to address. This is because leakage, i.e., the loss of information stored in the computational subspace to undesired subspaces in a larger Hilbert space, is more difficult to detect and correct than errors that preserve the computational subspace. As a result, leakage presents a significant obstacle to the development of fault-tolerant quantum computation. In this paper, we propose an efficient and accurate benchmarking framework called leakage randomized benchmarking (LRB), for measurin
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Universal models of computation"

1

Rohr, Alexander. "A universal realizability model for sequential functional computation." Phd thesis, [S.l.] : [s.n.], 2003. http://elib.tu-darmstadt.de/diss/000351.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Jung, Seohyun. "Average-case Completeness Results Using Universal Computational Models." Case Western Reserve University School of Graduate Studies / OhioLINK, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=case160752432028902.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Anandan, Princia. "Two phase microfluidics: new trend in model identification." Doctoral thesis, Università di Catania, 2013. http://hdl.handle.net/10761/1303.

Full text
Abstract:
The aim of the research is to give a proper understanding of the physical aspects involved in two-phase microfluidic systems: from the theoretical point of view to the development of numerical solutions for the flow field by Computational Modeling (CM) issue studies devoted to standard droplet generator for separation and segmented flow, bubble and drop formation, breakup and coalescence and then with increasing complexity in large scale microfluidic processors, bubble logic i.e. bubble to bubble hydrodynamic interaction provides an on-chip process control mechanism integrating chemistry and c
APA, Harvard, Vancouver, ISO, and other styles
4

Ilisei, Iustina-Narcisa. "A machine learning approach to the identification of translational language : an inquiry into translationese learning models." Thesis, University of Wolverhampton, 2012. http://hdl.handle.net/2436/299371.

Full text
Abstract:
In the world of Descriptive Translation Studies, translationese refers to the specific traits that characterise the language used in translations. While translationese has been often investigated to illustrate that translational language is different from non-translational language, scholars have also proposed a set of hypotheses which may characterise such di erences. In the quest for the validation of these hypotheses, embracing corpus-based techniques had a well-known impact in the domain, leading to several advances in the past twenty years. Despite extensive research, however, there are n
APA, Harvard, Vancouver, ISO, and other styles
5

Mommers, Cornelis Johannes Gerardus. "Universal Quantum Computation Using Discrete Holonomies." Thesis, Uppsala universitet, Materialteori, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-444209.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Carolan, Jacques. "Universal linear optics : characterisation, verification and computation." Thesis, University of Bristol, 2015. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.689594.

Full text
Abstract:
Photonic approaches to quantum information science and technology promise new scientific discoveries and new applications. Linear optics underpins all of these protocols, and the advent of integrated quantum photonics has has brought with it a step change in complexity and control over quantum photonic systems. As systems scale up, near-term nonclassical computational possibilities emerge, as does the prospect of practical quantum technologies. In this work we present a series of linear optical processors comprising the union of a multi-photon source, active and passive waveguide devices, and
APA, Harvard, Vancouver, ISO, and other styles
7

Milne, Darran F. "Towards universal quantum computation in continuous-variable systems." Thesis, University of St Andrews, 2012. http://hdl.handle.net/10023/3210.

Full text
Abstract:
In this thesis we explore the possibility of creating continuousvariable quantum systems that are capable of supporting universal quantum computation. We begin by examining the measurement-based model, which employs sequences of measurements on highly entangled resource states, known as a cluster states. We suggest a method for the construction of Gaussian cluster states based on ensembles of atoms and quantum non-demolition interactions. We then go on to expand our model to allow for the inclusion of light modes as part of the cluster. This yields a new class of states, the composite cluster
APA, Harvard, Vancouver, ISO, and other styles
8

Halil, Shah Kerem. "Extending ancilla driven universal quantum computation beyond stepwise determinism." Thesis, University of Strathclyde, 2016. http://digitool.lib.strath.ac.uk:80/R/?func=dbin-jump-full&object_id=27382.

Full text
Abstract:
A major research goal in the field of quantum computation is the construction of the universal quantum computer (UQC): a device that can implement any quantum algorithm. Several theoretical schemes for implementing UQC have been developed which require different sets of resources and capabilities with varying implications for the optimum experimental implementations. The ancilla driven quantum computation scheme (ADQC) comprises two subsystems: a memory register of qubits on which information is retained and processed and an ancilla system of qubits which couple to the register. This coupling
APA, Harvard, Vancouver, ISO, and other styles
9

Lehmann, Rüdiger. "A universal and robust computation procedure for geometric observations." Hochschule für Technik und Wirtschaft, 2017. https://htw-dresden.qucosa.de/id/qucosa%3A31843.

Full text
Abstract:
This contribution describes an automatic and robust method, which can be applied to all classical geodetic computation problems. Starting from given input quantities (e.g. coordinates of known points, observations) computation opportunities for all other relevant quantities are found. For redundant input quantities there exists a multitude of different computation opportunities from different minimal subsets of input quantities, which are all found automatically, and their results are computed and compared. If the computation is non-unique, but only a finite number of solutions exist, then all
APA, Harvard, Vancouver, ISO, and other styles
10

Lin, Cedric Yen-Yu. "Alternative models for quantum computation/." Thesis, Massachusetts Institute of Technology, 2015. http://hdl.handle.net/1721.1/99307.

Full text
Abstract:
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Physics, 2015.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (pages 165-181).<br>We propose and study two new computational models for quantum computation, and infer new insights about the circumstances that give quantum computers an advantage over classical ones. The bomb query complexity model is a variation on the query complexity model, inspired by the Elitzur-Vaidman bomb tester. In this model after each query to the black box the result is measured, and the algorithm fails if the measur
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Universal models of computation"

1

Bruni, Roberto, and Ugo Montanari. Models of Computation. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-42900-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Fernández, Maribel. Models of Computation. Springer London, 2009. http://dx.doi.org/10.1007/978-1-84882-434-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

1952-, Calude Cristian, Casti J. L, Dinneen M. J. 1957-, and International Conference on Unconventional Models of Computation (1st : 1998 : University of Auckland), eds. Unconventional models of computation. Springer, 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Clote, Peter. Boolean Functions and Computation Models. Springer Berlin Heidelberg, 2002.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Meduna, Alexander, and Ondřej Soukup. Modern Language Models and Computation. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-63100-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Löwe, Benedikt, Dag Normann, Ivan Soskov, and Alexandra Soskova, eds. Models of Computation in Context. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-21875-0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Clote, Peter, and Evangelos Kranakis. Boolean Functions and Computation Models. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/978-3-662-04943-3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Krynicki, Michał, Marcin Mostowski, and Lesław W. Szczerba, eds. Quantifiers: Logics, Models and Computation. Springer Netherlands, 1995. http://dx.doi.org/10.1007/978-94-017-0522-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Krynicki, Michał, Marcin Mostowski, and Lesław W. Szczerba, eds. Quantifiers: Logics, Models and Computation. Springer Netherlands, 1995. http://dx.doi.org/10.1007/978-94-017-0524-0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Evangelos, Kranakis, ed. Boolean functions and computation models. Springer, 2001.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Universal models of computation"

1

Börger, Egon, and Robert Stärk. "Universal Design and Computation Model." In Abstract State Machines. Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-642-18216-7_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Bezhanishvili, Nick, Dick de Jongh, Apostolos Tzimoulis, and Zhiguang Zhao. "Universal Models for the Positive Fragment of Intuitionistic Logic." In Logic, Language, and Computation. Springer Berlin Heidelberg, 2017. http://dx.doi.org/10.1007/978-3-662-54332-0_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Imai, Katsunobu, Kenji Fujita, Chuzo Iwamoto, and Kenichi Morita. "Embedding a Logically Universal Model and a Self-Reproducing Model into Number-Conserving Cellular Automata." In Unconventional Models of Computation. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45833-6_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

de Jongh, Dick, and Fan Yang. "Jankov’s Theorems for Intermediate Logics in the Setting of Universal Models." In Logic, Language, and Computation. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-22303-7_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Bezhanishvili, Nick, Dion Coumans, Samuel J. van Gool, and Dick de Jongh. "Duality and Universal Models for the Meet-Implication Fragment of IPC." In Logic, Language, and Computation. Springer Berlin Heidelberg, 2015. http://dx.doi.org/10.1007/978-3-662-46906-4_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Khodor, Julia, and David K. Gifford. "Programmed Mutagenesis Is a Universal Model of Computation." In DNA Computing. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-48017-x_28.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Fu, Lihua, and Huacan He. "A New Universal Combinatorial Operation Model with Unequal Weights." In Advances in Computation and Intelligence. Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-92137-0_66.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

de la Cruz Echeandía, Marina, and Alfonso Ortega de la Puente. "A Christiansen Grammar for Universal Splicing Systems." In Methods and Models in Artificial and Natural Computation. A Homage to Professor Mira’s Scientific Legacy. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-02264-7_35.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Carl, Merlin. "A Computational Approach to an Alternative Working Environment for the Constructible Universe." In Models of Computation in Context. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-21875-0_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Hausmann, Daniel, and Lutz Schröder. "Quasipolynomial Computation of Nested Fixpoints." In Tools and Algorithms for the Construction and Analysis of Systems. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-72016-2_3.

Full text
Abstract:
AbstractIt is well-known that the winning region of a parity game with n nodes and k priorities can be computed as a k-nested fixpoint of a suitable function; straightforward computation of this nested fixpoint requires $$\mathcal {O}(n^{\frac{k}{2}})$$ O ( n k 2 ) iterations of the function. Calude et al.’s recent quasipolynomial-time parity game solving algorithm essentially shows how to compute the same fixpoint in only quasipolynomially many iterations by reducing parity games to quasipolynomially sized safety games. Universal graphs have been used to modularize this transformation of pari
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Universal models of computation"

1

Du, Wei, Peixuan Li, Haodong Zhao, Tianjie Ju, Ge Ren, and Gongshen Liu. "UOR: Universal Backdoor Attacks on Pre-trained Language Models." In Findings of the Association for Computational Linguistics ACL 2024. Association for Computational Linguistics, 2024. http://dx.doi.org/10.18653/v1/2024.findings-acl.468.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Sharifymoghaddam, Sahel, Shivani Upadhyay, Wenhu Chen, and Jimmy Lin. "UniRAG: Universal Retrieval Augmentation for Large Vision Language Models." In Findings of the Association for Computational Linguistics: NAACL 2025. Association for Computational Linguistics, 2025. https://doi.org/10.18653/v1/2025.findings-naacl.108.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Wang, Bin, Xunlong Zou, Geyu Lin, et al. "AudioBench: A Universal Benchmark for Audio Large Language Models." In Proceedings of the 2025 Conference of the Nations of the Americas Chapter of the Association for Computational Linguistics: Human Language Technologies (Volume 1: Long Papers). Association for Computational Linguistics, 2025. https://doi.org/10.18653/v1/2025.naacl-long.218.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Lou, Qian, Xin Liang, Jiaqi Xue, Yancheng Zhang, Rui Xie, and Mengxin Zheng. "CR-UTP: Certified Robustness against Universal Text Perturbations on Large Language Models." In Findings of the Association for Computational Linguistics ACL 2024. Association for Computational Linguistics, 2024. http://dx.doi.org/10.18653/v1/2024.findings-acl.588.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Mastromattei, Michele, and Fabio Massimo Zanzotto. "Less is KEN: a Universal and Simple Non-Parametric Pruning Algorithm for Large Language Models." In Findings of the Association for Computational Linguistics ACL 2024. Association for Computational Linguistics, 2024. http://dx.doi.org/10.18653/v1/2024.findings-acl.674.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Karia, Tanuj, Giacomo Lastrucci, and Artur M. Schweidtmann. "Kolmogorov Arnold Networks (KANs) as surrogate models for global process optimization." In The 35th European Symposium on Computer Aided Process Engineering. PSE Press, 2025. https://doi.org/10.69997/sct.195815.

Full text
Abstract:
Surrogate models are widely used to improve the tractability of process optimization. Some commonly used surrogate models are obtained via machine learning such as multi-layer perceptrons (MLPs), Gaussian processes, and decision trees. Recently, a new class of machine learning models named Kolmogorov Arnold Networks (KANs) have been proposed. Broadly, KANs are similar to MLPs, yet they are based on the Kolmogorov representation theorem instead of the universal approximation theorem for the MLPs. Compared to MLPs, it was reported that KANs require significantly fewer parameters to approximate a
APA, Harvard, Vancouver, ISO, and other styles
7

Aminof, Benjamin, Linus Cooper, Sasha Rubin, Moshe Y. Vardi, and Florian Zuleger. "Probabilistic Synthesis and Verification for LTL on Finite Traces." In 21st International Conference on Principles of Knowledge Representation and Reasoning {KR-2023}. International Joint Conferences on Artificial Intelligence Organization, 2024. http://dx.doi.org/10.24963/kr.2024/3.

Full text
Abstract:
We study synthesis and verification of probabilistic models and specifications over finite traces. Probabilistic models are formalized in this work as Markov Chains and Markov Decisions Processes. Motivated by the recent attention given to, and importance of, finite-trace specifications in AI, we use linear-temporal logic on finite traces as a specification formalism for properties of traces with finite but unbounded time horizons. Since there is no bound on the time horizon, our Markov chains generate infinite traces, and we consider two possible semantics: “existential (resp. universal) pref
APA, Harvard, Vancouver, ISO, and other styles
8

Ćalasan, Martin, Mihailo Micev, and Milovan Radulović. "Universal Modified n-diode Solar Cell Models." In 2025 24th International Symposium INFOTEH-JAHORINA (INFOTEH). IEEE, 2025. https://doi.org/10.1109/infoteh64129.2025.10959080.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Jenkins, B. Keith, and C. Lee Giles. "Optical architecture implications of parallel computation models." In OSA Annual Meeting. Optica Publishing Group, 1986. http://dx.doi.org/10.1364/oam.1986.ml4.

Full text
Abstract:
We describe the use and implications of parallel models of computation in the design of optical architectures. The models covered include shared memory models and graph/network models1; these models can be universal machines. Shared memory models consist of a set of processing elements operating in parallel and communicating with a global memory in an extremely general, contention-free manner; these models provide for fast computation of parallel algorithms. An architecture derived from a shared memory model is introduced and includes a set of electronic or optical processors, an optical recon
APA, Harvard, Vancouver, ISO, and other styles
10

Naughton, Thomas J. "Continuous-space model of computation is Turing universal." In International Symposium on Optical Science and Technology, edited by Sunny Bains and Leo J. Irakliotis. SPIE, 2000. http://dx.doi.org/10.1117/12.409212.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Universal models of computation"

1

Ferdaus, Md Meftahul, Mahdi Abdelguerfi, Elias Ioup, et al. KANICE : Kolmogorov-Arnold networks with interactive convolutional elements. Engineer Research and Development Center (U.S.), 2025. https://doi.org/10.21079/11681/49791.

Full text
Abstract:
We introduce KANICE, a novel neural architecture that combines Convolutional Neural Networks (CNNs) with Kolmogorov-Arnold Network (KAN) principles. KANICE integrates Interactive Convolutional Blocks (ICBs) and KAN linear layers into a CNN framework. This leverages KANs’ universal approximation capabilities and ICBs’ adaptive feature learning. KANICE captures complex, non-linear data relationships while enabling dynamic, context-dependent feature extraction based on the Kolmogorov-Arnold representation theorem. We evaluated KANICE on four datasets: MNIST, Fashion-MNIST, EMNIST, and SVHN, compa
APA, Harvard, Vancouver, ISO, and other styles
2

Chen, H. H., and Y. C. Lee. Connectionist Models for Intelligent Computation. Defense Technical Information Center, 1994. http://dx.doi.org/10.21236/ada286436.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Chen, H. H., and Y. C. Lee. Connectionist Models for Intelligent Computation. Defense Technical Information Center, 1994. http://dx.doi.org/10.21236/ada296789.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Chen, H. H., and Y. C. Lee. Connectionist Models for Intelligent Computation. Defense Technical Information Center, 1989. http://dx.doi.org/10.21236/ada228949.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Yepez, Jeffrey. New World Vistas: New Models of Computation Lattice Based Quantum Computation. Defense Technical Information Center, 1996. http://dx.doi.org/10.21236/ada421712.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Medina, Alberta, Gonca Gursun, Prithwish Basu, and Ibrahim Matta. On the Universal Generation of Mobility Models. Defense Technical Information Center, 2010. http://dx.doi.org/10.21236/ada522737.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Boghosian, Bruce M. Entropic Lattice Boltzmann Models and Quantum Computation. Defense Technical Information Center, 2008. http://dx.doi.org/10.21236/ada484718.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Nugent, Peter. HPC-enabled computation of demand models at scale. Office of Scientific and Technical Information (OSTI), 2020. http://dx.doi.org/10.2172/1617377.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Knoblich, Ulf, Jake Bouvrie, and Tomaso Poggio. Biophysical Models of Neural Computation: Max and Tuning Circuits. Defense Technical Information Center, 2007. http://dx.doi.org/10.21236/ada466426.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Faraggi, A. E. Family universal anomalous U(1) in realistic superstring derived models. Office of Scientific and Technical Information (OSTI), 1998. http://dx.doi.org/10.2172/604343.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Universal models of computation' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography